Sciweavers

1041 search results - page 68 / 209
» Randomizing Reductions of Search Problems
Sort
View
ACST
2006
15 years 6 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
ECAI
2004
Springer
15 years 10 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
142
Voted
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 4 months ago
Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm
This paper combines the idea of a hierarchical distributed genetic algorithm with different interagent partnering strategies. Cascading clusters of sub-populations are built from ...
Uwe Aickelin, Larry Bull
122
Voted
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 4 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
CORR
2006
Springer
148views Education» more  CORR 2006»
15 years 4 months ago
Budget Optimization in Search-Based Advertising Auctions
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...