Sciweavers

1263 search results - page 147 / 253
» A* with Bounded Costs
Sort
View
TRANSCI
2008
94views more  TRANSCI 2008»
13 years 8 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...
4OR
2010
148views more  4OR 2010»
13 years 8 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
ADBIS
2009
Springer
135views Database» more  ADBIS 2009»
13 years 7 months ago
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...
CN
2011
88views more  CN 2011»
13 years 4 months ago
Multi-hour network planning based on domination between sets of traffic matrices
—In multi-hour network design, periodic traffic variations along time are considered in the dimensioning process. Then, the non coincidence of traffic peaks along the day or the ...
Pablo Pavón-Mariño, Belen Garcia-Man...
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 4 months ago
Hide-and-Seek with Directional Sensing
: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
Alessandro Borri, Shaunak Dattaprasad Bopardikar, ...