2796 search results - page 109 / 560 » The coolest path problem |
162
click to vote
ICS
2011
Tsinghua U.
14 years 8 months ago
2011
Tsinghua U.
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
134
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
126
Voted
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
187
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
144
click to vote
ERSHOV
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...