Sciweavers

195 search results - page 37 / 39
» Distributed abductive reasoning with constraints
Sort
View
SPAA
2003
ACM
13 years 11 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
IPPS
2000
IEEE
13 years 10 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
MONET
2011
13 years 1 months ago
Jamming in Wireless Networks Under Uncertainty
— The problem of jamming plays an important role in ensuring the quality and security of wireless communications, especially at this moment when wireless networks are quickly bec...
Eitan Altman, Konstantin Avrachenkov, Andrey Garna...
GIS
2007
ACM
14 years 7 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
GIS
2008
ACM
14 years 7 months ago
Low-cost orthographic imagery
Commercial aerial imagery websites, such as Google Maps, MapQuest, Microsoft Virtual Earth, and Yahoo! Maps, provide high- seamless orthographic imagery for many populated areas, ...
Peter Pesti, Jeremy Elson, Jon Howell, Drew Steedl...