3055 search results - page 280 / 611 » Randomized Search Trees |
122
Voted
IBERAMIA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
102
Voted
AAAI
2006
15 years 4 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
160
Voted
TEC
2002
15 years 3 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
165
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...
144
Voted
IMCSIT
2010
15 years 1 months ago
2010
Abstract--The constrained optimization with differential evolution (DE) is addressed. A novel variant of competitive differential evolution with a hybridized search of feasibility ...