Sciweavers

510 search results - page 19 / 102
» How Should We Solve Search Problems Privately
Sort
View
TRANSCI
2002
106views more  TRANSCI 2002»
13 years 7 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...
AMAI
1999
Springer
13 years 7 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
JVA
2006
IEEE
14 years 1 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
MSWIM
2003
ACM
14 years 22 days ago
Flooding strategy for target discovery in wireless networks
In this paper, we address a fundamental problem concerning the best flooding strategy to minimize cost and latency for target discovery in wireless networks. Should we flood the ...
Zhao Cheng, Wendi Beth Heinzelman
CONEXT
2006
ACM
14 years 1 months ago
Reformulating the monitor placement problem: optimal network-wide sampling
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
Gion Reto Cantieni, Gianluca Iannaccone, Chadi Bar...