7522 search results - page 36 / 1505 » Spacing memetic algorithms |
129
Voted
AAAI
1996
15 years 1 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
97
Voted
NIPS
1993
15 years 1 months ago
1993
Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensionalcontinuousstate-spaces. In high dimensions it is essential that learningdoes not...
116
Voted
ECCC
2010
14 years 9 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
102
click to vote
ECML
2005
Springer
15 years 6 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
119
click to vote
GLOBECOM
2007
IEEE
15 years 17 days ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...