Sciweavers

613 search results - page 35 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
151
Voted
ISTAR
2008
15 years 4 months ago
Improving the Syntax and Semantics of Goal Modelling Languages
One major obstacle to requirements engineering (RE) is the growing complexity of today's systems. Such a complexity can only be fficiently by powerful abstraction mechanisms a...
Raimundas Matulevicius
154
Voted
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 6 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
146
Voted
ICCV
2007
IEEE
16 years 4 months ago
Out-of-Core Bundle Adjustment for Large-Scale 3D Reconstruction
Large-scale 3D reconstruction has recently received much attention from the computer vision community. Bundle adjustment is a key component of 3D reconstruction problems. However,...
Kai Ni, Drew Steedly, Frank Dellaert
137
Voted
STACS
2009
Springer
15 years 7 months ago
Lower Bounds for Multi-Pass Processing of Multiple Data Streams
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
Nicole Schweikardt
138
Voted
FLAIRS
2004
15 years 4 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar