3360 search results - page 589 / 672 » Opportunistic Data Structures with Applications |
149
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
137
click to vote
WIA
2000
Springer
15 years 7 months ago
2000
Springer
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
138
Voted
SMA
1995
ACM
15 years 7 months ago
1995
ACM
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
108
click to vote
DBPL
1991
Springer
15 years 7 months ago
1991
Springer
BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive typ...
140
Voted
AAAI
2008
15 years 5 months ago
2008
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...