Sciweavers

255 search results - page 4 / 51
» A Generalized Cyclic-Clustering Approach for Solving Structu...
Sort
View
ECAI
2008
Springer
13 years 7 months ago
A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
Emmanuel Rachelson, Gauthier Quesnel, Fréd&...
SARA
2009
Springer
13 years 12 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
KI
2006
Springer
13 years 5 months ago
Solving Proportional Analogies by E -Generalization
We present an approach for solving proportional analogies of the form A : B :: C : D where a plausible outcome for D is computed. The core of the approach is E
Stephan Weller, Ute Schmid
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 2 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 1 months ago
Smoothing Proximal Gradient Method for General Structured Sparse Learning
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
Xi Chen, Qihang Lin, Seyoung Kim, Jaime G. Carbone...