Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 77 total

A comparative study between dynamic web scripting languages. (English)
Kannan, Rajkumar (ed.) et al., Data engineering and management. Second international conference, ICDEM 2010, Tiruchirappalli, India, July 29‒31, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-27871-6/pbk). Lecture Notes in Computer Science 6411, 288-295 (2012).
WorldCat.org
1
A new approach for tubular structure modeling and segmentation using graph-based techniques. (English)
Fichtinger, Gabor (ed.) et al., Medical image computing and computer-assisted intervention ‒ MICCAI 2011. 14th international conference, Toronto, Canada, September 18‒22, 2011. Proceedings, Part III. Berlin: Springer (ISBN 978-3-642-23625-9/pbk). Lecture Notes in Computer Science 6893, 305-312 (2011).
WorldCat.org
2
Vehicle routing based on traffic cost at intersection. (English)
O’Shea, James (ed.) et al., Agent and multi-agent systems: technologies and applications. 5th KES international conference, KES-AMSTA 2011, Manchester, UK, June 29 ‒ July 1, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21999-3/pbk). Lecture Notes in Computer Science 6682. Lecture Notes in Artificial Intelligence, 592-601 (2011).
WorldCat.org
3
Base Station controlled intelligent clustering routing in wireless sensor networks. (English)
Butz, Cory (ed.) et al., Advances in artificial intelligence. 24th Canadian conference on artificial intelligence, Canadian AI 2011, St. John’s, Canada, May 25‒27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21042-6/pbk). Lecture Notes in Computer Science 6657. Lecture Notes in Artificial Intelligence, 210-215 (2011).
WorldCat.org
4
Finding the shortest paths by node combination. (English)
Appl. Math. Comput. 217, No. 13, 6401-6408 (2011).
WorldCat.org
5
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem. (English)
Computing 90, No. 3-4, 113-130 (2010).
WorldCat.org
6
Route advising in a dynamic environment - A high-tech approach. (English)
Sobh, Tarek (ed.) et al., Innovations in computing sciences and software engineering. Proceedings of the 2009 second international conference on systems, computing sciences and software engineering (SCSS), December 4‒12, 2009. Dordrecht: Springer (ISBN 978-90-481-9111-6/hbk; 978-90-481-9112-3/ebook). 249-254 (2010).
WorldCat.org
7
On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms. (English)
Distrib. Comput. 23, No. 1, 43-60 (2010).
WorldCat.org
8
Simulating weighted, directed small-world networks. (English)
Appl. Math. Comput. 216, No. 7, 2118-2128 (2010).
WorldCat.org
9
A faster algorithm for the single source shortest path problem with few distinct positive lengths. (English)
J. Discrete Algorithms 8, No. 2, 189-198 (2010).
WorldCat.org
10
A novel single source shortest path algorithm. (English)
J. Discrete Math. Sci. Cryptography 12, No. 6, 671-680 (2009).
WorldCat.org
11
A generalization of Dijkstra’s shortest path algorithm with applications to VLSI routing. (English)
J. Discrete Algorithms 7, No. 4, 377-390 (2009).
WorldCat.org
12
A research on the transportation problem based on transport order. (Chinese)
J. Guangzhou Univ., Nat. Sci. 7, No. 5, 1-4 (2008).
WorldCat.org
13
On solving shortest paths with a least-squares primal-dual algorithm. (English)
Asia-Pac. J. Oper. Res. 25, No. 2, 135-150 (2008).
WorldCat.org
14
On short paths interdiction problems: Total and node-wise limited interdiction. (English)
Theory Comput. Syst. 43, No. 2, 204-233 (2008).
WorldCat.org
15
Minimum path exposure and detection interval setting for target detection using wireless sensor network. (English)
Int. J. Wirel. Inf. Netw. 14, No. 4, 289-294 (2007).
WorldCat.org
16
Shortest paths and Steiner trees in VLSI routing. (English)
Bonn: Univ. Bonn, Mathematisch-Naturwissenschaftliche Fakultät (Dissertation). viii, 126~p. (2007).
WorldCat.org
17
Toward optimal routing of lightpaths in dynamic WDM networks. (English)
Dyn. Contin. Discrete Impuls. Syst., Ser. B, Appl. Algorithms 15, No. 4, 495-506 (2008).
WorldCat.org
18
An improved Dijkstra’s shortest path algorithm for sparse network. (English)
Appl. Math. Comput. 185, No. 1, 247-254 (2007).
WorldCat.org
19
Solving the shortest path problem with interval arcs. (English)
Fuzzy Optim. Decis. Mak. 5, No. 1, 71-89 (2006).
WorldCat.org
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 77 total

Valid XHTML 1.0 Transitional Valid CSS!