Sciweavers

2657 search results - page 99 / 532
» On the complexity of hierarchical problem solving
Sort
View
CVPR
2004
IEEE
16 years 3 months ago
Efficient Search of Faces from Complex Line Drawings
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...
Jianzhuang Liu, Xiaoou Tang
97
Voted
FM
2009
Springer
95views Formal Methods» more  FM 2009»
15 years 6 months ago
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
73
Voted
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
15 years 5 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
CAD
2000
Springer
15 years 1 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
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
15 years 6 months ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
Alexander Scivos, Bernhard Nebel