435 search results - page 6 / 87 » Partitioning Search Spaces of a Randomized Search |
124
Voted
CLA
2007
15 years 5 months ago
2007
The interest in a further pruning of the set of frequent patterns that can be drawn from real-life datasets is growing up. In fact, it is a quite survival reflex towards providing...
156
Voted
AAAI
2007
15 years 5 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
118
Voted
EVOW
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
351
Voted
ICDE
2000
IEEE
16 years 4 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
148
click to vote
FLAIRS
2004
15 years 4 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...