2905 search results - page 119 / 581 » Formal Memetic Algorithms |
115
Voted
EKAW
2000
Springer
15 years 7 months ago
2000
Springer
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
128
Voted
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
125
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
142
Voted
AI
2003
Springer
15 years 9 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
158
Voted
PKDD
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...