Sciweavers

169 search results - page 24 / 34
» Decentralized Search with Random Costs
Sort
View
DKE
2008
87views more  DKE 2008»
13 years 6 months ago
Region clustering based evaluation of multiple top-N selection queries
In many database applications, there are opportunities for multiple top-N queries to be evaluated at the same time. Often it is more cost effective to evaluate multiple such queri...
Liang Zhu, Weiyi Meng, Wenzhu Yang, Chunnian Liu
IJHIS
2007
89views more  IJHIS 2007»
13 years 6 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
IAJIT
2010
94views more  IAJIT 2010»
13 years 5 months ago
Multiple Warehouses Scheduling Using Steady State. Genetic Algorithms
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...
Jalal Atoum, Mamoun Al Rababaa
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 27 days ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
WSC
2008
13 years 9 months ago
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...