Sciweavers

376 search results - page 50 / 76
» Solution Counting Algorithms for Constraint-Centered Search ...
Sort
View
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
13 years 10 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
WIOPT
2005
IEEE
14 years 2 months ago
Iterated Local Optimization for Minimum Energy Broadcast
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
Intae Kang, Radha Poovendran
CPAIOR
2007
Springer
14 years 3 months ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
SIGIR
2009
ACM
14 years 3 months ago
Positional language models for information retrieval
Although many variants of language models have been proposed for information retrieval, there are two related retrieval heuristics remaining “external” to the language modelin...
Yuanhua Lv, ChengXiang Zhai
AAAI
1998
13 years 10 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman