279 search results - page 24 / 56 » Reduction approaches for robust shortest path problems |
104
Voted
CONSTRAINTS
2006
14 years 9 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
JUCS
2010
14 years 8 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
ANSS
2006
IEEE
15 years 3 months ago
2006
IEEE
The explosive growth of multimedia and other bandwidth intensive applications has resulted a rapid increase in the size of the traffic loads that needs to be supported by modern n...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
102
click to vote
AUSAI
2008
Springer
14 years 11 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...