Sciweavers

5316 search results - page 12 / 1064
» Which Search Problems Are Random
Sort
View
EMO
2009
Springer
219views Optimization» more  EMO 2009»
14 years 3 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva
ICRA
2000
IEEE
124views Robotics» more  ICRA 2000»
14 years 27 days ago
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Joaquín Bautista, Raúl Suárez...
KI
1999
Springer
14 years 23 days ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
INFOCOM
2009
IEEE
14 years 3 months ago
Budget-Based Self-Optimized Incentive Search in Unstructured P2P Networks
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
Yi Hu, Min Feng, Laxmi N. Bhuyan, Vana Kalogeraki
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 2 months 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...