2796 search results - page 428 / 560 » The coolest path problem |
213
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
201
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
209
click to vote
MOBICOM
2012
ACM
13 years 8 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
168
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
151
click to vote
AMAI
2008
Springer
15 years 6 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...