3320 search results - page 86 / 664 » Heuristics for the Phylogeny Problem |
180
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
138
Voted
COMPSAC
2004
IEEE
15 years 9 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
170
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
137
click to vote
SARA
2000
Springer
15 years 9 months ago
2000
Springer
In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik's Cube, wi...
134
click to vote
IPL
2002
15 years 5 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...