1046 search results - page 73 / 210 » Approximation Algorithms for Domination Search |
167
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
98
Voted
AISB
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
109
click to vote
AI
2006
Springer
15 years 17 days ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
73
Voted
AAAI
1998
15 years 1 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
107
click to vote
DAM
2008
15 years 18 days ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...