Sciweavers

594 search results - page 38 / 119
» Travelling Miser Problem
Sort
View
SAC
2003
ACM
14 years 1 months ago
reality: a Scalable Intelligent Travel Planner
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
Marc Torrens, Patrick Hertzog, Loic Samson, Boi Fa...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 8 months ago
Skippy: a new snapshot indexing method for time travel in the storage manager
The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived p...
Ross Shaull, Liuba Shrira, Hao Xu
SIGMOD
2007
ACM
108views Database» more  SIGMOD 2007»
14 years 8 months ago
Travel time estimation using NiagaraST and latte
To address increasing traffic congestion and its associated consequences, traffic managers are turning to intelligent transportation management. The latte project is extending dat...
Kristin Tufte, Jin Li, David Maier, Vassilis Papad...
ESWS
2008
Springer
13 years 9 months ago
XSPARQL: Traveling between the XML and RDF Worlds - and Avoiding the XSLT Pilgrimage
With currently available tools and languages, translating between an existing XML format and RDF is a tedious and error-prone task. The importance of this problem is acknowledged b...
Waseem Akhtar, Jacek Kopecký, Thomas Krennw...
DISOPT
2006
101views more  DISOPT 2006»
13 years 7 months ago
Greedy-type resistance of combinatorial problems
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
Gareth Bendall, François Margot