26 search results - page 5 / 6 » A metaheuristic approach to the urban transit routing proble... |
ANOR
2011
13 years 1 months ago
2011
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
MOBIHOC
2009
ACM
14 years 7 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
RAID
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Attack analysis is a challenging problem, especially in emerging environments where there are few known attack cases. One such new environment is the Mobile Ad hoc Networ...
IJCAI
2007
13 years 7 months ago
2007
In modern urban settings, automobile traffic and collisions lead to endless frustration as well as significant loss of life, property, and productivity. Recent advances in arti...
ASPDAC
2008
ACM
13 years 8 months ago
2008
ACM
Abstract--In this paper, the problem of bus driven floorplanning is addressed. Given a set of modules and bus specifications, a floorplan solution including the bus routes will be ...