Sciweavers

2657 search results - page 313 / 532
» On the complexity of hierarchical problem solving
Sort
View
COMPGEOM
2004
ACM
16 years 7 days ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
CP
2004
Springer
16 years 6 days ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
CPM
2010
Springer
120views Combinatorics» more  CPM 2010»
15 years 11 months ago
Mod/Resc Parsimony Inference
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Eng...
198
Voted
ICCAD
1996
IEEE
164views Hardware» more  ICCAD 1996»
15 years 11 months ago
A novel dimension reduction technique for the capacitance extraction of 3D VLSI interconnects
In this paper, we present a new capacitance extraction method named Dimension Reduction Technique (DRT) for 3D VLSI interconnects. The DRT converts a complex 3D problem into a ser...
Wei Hong II, Weikai Sun, Zhenhai Zhu, Hao Ji, Ben ...
CP
1997
Springer
15 years 11 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...