8413 search results - page 1100 / 1683 » Ordering Problem Subgoals |
200
click to vote
AI
2000
Springer
15 years 7 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
215
click to vote
APIN
2000
15 years 7 months ago
2000
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
191
click to vote
JC
2000
15 years 7 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
224
click to vote
IJRR
2002
15 years 6 months ago
2002
This paper investigates safe and efficient map-building strategies for a mobile robot with imperfect control and sensing. In the implementation, a robot equipped with a range sens...
190
click to vote
JMLR
2002
15 years 6 months ago
2002
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...