2796 search results - page 396 / 560 » The coolest path problem |
147
click to vote
PPOPP
2005
ACM
16 years 16 hour ago
2005
ACM
Dataraces in multithreaded programs often indicate severe bugs and can cause unexpected behaviors when different thread interleavings are executed. Because dataraces are a cause f...
174
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
165
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Cyclic genetic algorithms can be used to generate single loop control programs for robots. While successful in generating controllers for individual leg movement, gait generation,...
165
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
144
click to vote
WS
2004
ACM
15 years 12 months ago
2004
ACM
Title of Thesis: DISTRIBUTED TRUST EVALUATION IN AD-HOC NETWORKS Georgios E. Theodorakopoulos, Master of Science, 2004 Thesis directed by: Professor John S. Baras Department of El...