Sciweavers

2778 search results - page 87 / 556
» Limit complexities revisited
Sort
View
ALGOSENSORS
2008
Springer
15 years 6 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
CAD
2000
Springer
15 years 4 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
TEC
2002
183views more  TEC 2002»
15 years 4 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 2 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
SEKE
2010
Springer
15 years 2 months ago
Ontology-Based Test Case Generation For Simulating Complex Production Automation Systems
—The behavior of complex production automation systems is hard to predict, therefore simulation is used to study the likely system behavior. However, in a real-world system many ...
Thomas Moser, Gregor Dürr, Stefan Biffl