Sciweavers

3779 search results - page 20 / 756
» Linear Consistency Testing
Sort
View
CPAIOR
2006
Springer
15 years 1 months ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
CP
2005
Springer
15 years 3 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
ICCV
2003
IEEE
15 years 11 months ago
Boosting Chain Learning for Object Detection
A general classification framework, called boosting chain, is proposed for learning boosting cascade. In this framework, a "chain" structure is introduced to integrate h...
Rong Xiao, Long Zhu, HongJiang Zhang
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
15 years 10 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
MOC
2000
73views more  MOC 2000»
14 years 9 months ago
Korovkin tests, approximation, and ergodic theory
We consider sequences of s
Stefano Serra Capizzano