Sciweavers

6894 search results - page 426 / 1379
» Generation Problems
Sort
View
DMS
2008
226views Multimedia» more  DMS 2008»
15 years 8 months ago
Towards Multi-provider LBS Visual Portals
Location-Based Services (LBS) are more and more commonly accessed through PDA or smart phones. As portals deriving of services delivered by a unique provider are easy to define, t...
Silvia E. Gordillo, Robert Laurini, Catalina Mosta...
ECIS
2003
15 years 8 months ago
Towards definitive benchmarking of algorithm performance
One of the primary methods employed by researchers to judge the merits of new heuristics and algorithms is to run them on accepted benchmark test cases and comparing their perform...
Andrew Lim, Wee-Chong Oon, Wenbin Zhu
CP
2010
Springer
15 years 4 months ago
Contingency Plans for Air Traffic Management
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
Karl Sundequist Blomdahl, Pierre Flener, Justin Pe...
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 7 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan