Sciweavers

185 search results - page 22 / 37
» Parameterized Complexity of Constraint Satisfaction Problems
Sort
View
CP
1999
Springer
13 years 12 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
WG
2005
Springer
14 years 1 months ago
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
Guillaume Blin, Guillaume Fertin, Danny Hermelin, ...
IVA
2010
Springer
13 years 6 months ago
Interactive Motion Modeling and Parameterization by Direct Demonstration
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...
Carlo Camporesi, Yazhou Huang, Marcelo Kallmann
AI
2003
Springer
14 years 27 days ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin