Sciweavers

365 search results - page 30 / 73
» An Approach to Multiply Segmented Constraint Satisfaction Pr...
Sort
View
AUSAI
2006
Springer
15 years 4 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
ECAI
2000
Springer
15 years 4 months ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
AIPS
1994
15 years 1 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
85
Voted
ICMCS
1999
IEEE
130views Multimedia» more  ICMCS 1999»
15 years 4 months ago
A Combinatorial Approach to Content-Based Music Selection
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
François Pachet, Pierre Roy, Daniel Cazaly
84
Voted
AUTOMATICA
2008
114views more  AUTOMATICA 2008»
15 years 16 days ago
A synthesis approach for output feedback robust constrained model predictive control
This paper addresses the synthesis approach to output feedback robust model predictive control for systems with polytopic description, bounded state disturbance and measurement no...
BaoCang Ding, YuGeng Xi, Marcin T. Cychowski, Thom...