Sciweavers

4524 search results - page 59 / 905
» The Complexity of Global Constraints
Sort
View
86
Voted
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 4 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
ECAI
2000
Springer
15 years 4 months ago
A Framework for Dynamic Constraint Reasoning using Procedural Constraints
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
Ari K. Jónsson, Jeremy Frank
121
Voted
CVPR
2005
IEEE
16 years 2 months ago
Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information
This paper considers the objectives of accurate stereo matching, especially at object boundaries, robustness against recording or illumination changes and efficiency of the calcul...
Heiko Hirschmüller
107
Voted
AAAI
2008
15 years 2 months ago
Local Search for Optimal Global Map Generation Using Mid-Decadal Landsat Images
NASA and USGS are collaborating to produce a global map of Earth using Landsat 5 Thematic Mapper and Landsat 7 Enhanced Thematic Mapper Plus sensor data from the period of 2004 th...
Robert A. Morris, John Gasch, Lina Khatib, Steven ...
IJCAI
2003
15 years 1 months ago
Logic Programs for Consistently Querying Data Integration Systems
We solve the problem of obtaining answers to queries posed to a mediated integration system un­ der the local-as-view paradigm that are consistent wrt to certain global integrity...
Loreto Bravo, Leopoldo E. Bertossi