Sciweavers

3758 search results - page 583 / 752
» A Complete Subsumption Algorithm
Sort
View
SIGGRAPH
2010
ACM
15 years 2 months ago
Non-local scan consolidation for 3D urban scenes
Recent advances in scanning technologies, in particular devices that extract depth through active sensing, allow fast scanning of urban scenes. Such rapid acquisition incurs imper...
Qian Zheng, Andrei Sharf, Guowei Wan, Yangyan Li, ...
IEAAIE
2001
Springer
15 years 2 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
COMPSAC
2000
IEEE
15 years 2 months ago
GAPS: A Genetic Programming System
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
Michael D. Kramer, Du Zhang
ECRTS
2000
IEEE
15 years 2 months ago
Tolerating faults while maximizing reward
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
ICCAD
2000
IEEE
188views Hardware» more  ICCAD 2000»
15 years 2 months ago
Bus Optimization for Low-Power Data Path Synthesis Based on Network Flow Method
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
Sungpack Hong, Taewhan Kim