1615 search results - page 72 / 323 » Pathology in heuristic search |
KDID
2004
15 years 2 months ago
2004
Abstract. Recently, different works proposed a new way to mine patterns in databases with pathological size. For example, experiments in genome biology usually provide databases wi...
89
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
85
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
102
click to vote
IBERAMIA
2004
Springer
15 years 6 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...
EVOW
2009
Springer
15 years 7 months ago
2009
Springer
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...