Sciweavers

551 search results - page 60 / 111
» Continuous Search in Constraint Programming
Sort
View
179
Voted
CPAIOR
2010
Springer
15 years 18 days ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
126
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
Juzi: a tool for repairing complex data structures
This paper describes Juzi, a tool for automatic repair of complex data structures. Juzi takes a Java class representing the data structure as well as a predicate method that speci...
Bassem Elkarablieh, Sarfraz Khurshid
SIBGRAPI
2005
IEEE
15 years 8 months ago
Linear Complexity Stereo Matching Based on Region Indexing
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...
114
Voted
ESOA
2006
15 years 6 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
111
Voted
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 50 min ago
Lattice model refinement of protein structures
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
Martin Mann, Alessandro Dal Palù