Sciweavers

1263 search results - page 40 / 253
» A* with Bounded Costs
Sort
View
IOR
2007
58views more  IOR 2007»
14 years 9 months ago
Bounds, Heuristics, and Approximations for Distribution Systems
This paper develops simple approximate methods to analyze a two-stage stochastic distribution system consisting of one warehouse and multiple retailers. We consider local and cent...
Guillermo Gallego, Özalp Özer, Paul H. Z...
WINE
2009
Springer
140views Economy» more  WINE 2009»
15 years 4 months ago
Tighter Bounds for Facility Games
In one dimensional facility games, public facilities are placed based on the reported locations of the agents, where all the locations of agents and facilities are on a real line. ...
Pinyan Lu, Yajun Wang, Yuan Zhou
SAC
2008
ACM
14 years 9 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
MOBICOM
2006
ACM
15 years 3 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
WINE
2005
Springer
109views Economy» more  WINE 2005»
15 years 3 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...