1884 search results - page 117 / 377 » Simple Algorithm for Simple Timed Games |
131
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
121
click to vote
SSPR
2004
Springer
15 years 7 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
109
Voted
CIAC
1997
Springer
15 years 6 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
129
click to vote
RSCTC
2000
Springer
15 years 5 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
136
click to vote
RTCSA
2003
IEEE
15 years 7 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...