Sciweavers

39 search results - page 8 / 8
» Caching all plans with just one optimizer call
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
13 years 10 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
PLDI
2011
ACM
12 years 8 months ago
Isolating and understanding concurrency errors using reconstructed execution fragments
In this paper we propose Recon, a new general approach to concurrency debugging. Recon goes beyond just detecting bugs, it also presents to the programmer short fragments of buggy...
Brandon Lucia, Benjamin P. Wood, Luis Ceze
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
13 years 12 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
13 years 12 months ago
Data gathering tours for mobile robots
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
Deepak Bhadauria, Volkan Isler