Sciweavers

1786 search results - page 269 / 358
» Domain Independent Generative Modeling
Sort
View
CPAIOR
2004
Springer
15 years 6 months ago
A Global Constraint for Graph Isomorphism Problems
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
Sébastien Sorlin, Christine Solnon
CP
2006
Springer
15 years 6 months ago
Towards an Efficient SAT Encoding for Temporal Reasoning
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
Duc Nghia Pham, John Thornton, Abdul Sattar
EVOW
2008
Springer
15 years 4 months ago
A Hybrid Random Subspace Classifier Fusion Approach for Protein Mass Spectra Classification
Classifier fusion strategies have shown great potential to enhance the performance of pattern recognition systems. There is an agreement among researchers in classifier combination...
Amin Assareh, Mohammad Hassan Moradi, L. Gwenn Vol...
4OR
2008
79views more  4OR 2008»
15 years 2 months ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 2 months ago
Learning Probabilistic Hierarchical Task Networks to Capture User Preferences
While much work on learning in planning focused on learning domain physics (i.e., action models), and search control knowledge, little attention has been paid towards learning use...
Nan Li, William Cushing, Subbarao Kambhampati, Sun...