134 search results - page 20 / 27 » An Optimal Rebuilding Strategy for an Incremental Tree Probl... |
78
Voted
EUROGP
2007
Springer
15 years 5 months ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
86
Voted
INFORMS
2010
14 years 9 months ago
2010
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
84
Voted
SODA
2010
ACM
15 years 8 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
166
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
85
Voted
HEURISTICS
2002
14 years 10 months ago
2002
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...