613 search results - page 114 / 123 » The Memory Fragmentation Problem: Solved |
133
click to vote
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
123
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
149
click to vote
ICIAR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Background updating is an important aspect of dynamic scene analysis. Two critical problems: sudden camera perturbation and the sleeping person problem, which arise frequ...
115
click to vote
VLDB
2004
ACM
15 years 7 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
130
Voted
GRID
2000
Springer
15 years 6 months ago
2000
Springer
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...