Sciweavers

201 search results - page 28 / 41
» New Structural Decomposition Techniques for Constraint Satis...
Sort
View
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 4 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
ICPR
2004
IEEE
16 years 24 days ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
15 years 4 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet
IROS
2007
IEEE
125views Robotics» more  IROS 2007»
15 years 6 months ago
Probabilistic inference for structured planning in robotics
Abstract— Real-world robotic environments are highly structured. The scalability of planning and reasoning methods to cope with complex problems in such environments crucially de...
Marc Toussaint, Christian Goerick
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
16 years 2 days ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani