Sciweavers

955 search results - page 111 / 191
» A System for Solving Constraint Satisfaction Problems with S...
Sort
View
IJCAI
2003
13 years 9 months ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
EDM
2008
141views Data Mining» more  EDM 2008»
13 years 9 months ago
Acquiring Background Knowledge for Intelligent Tutoring Systems
One of the unresolved problems faced in the construction of intelligent tutoring systems is the acquisition of background knowledge, either for the specification of the teaching st...
Cláudia Antunes
AUTOMATICA
2006
99views more  AUTOMATICA 2006»
13 years 8 months ago
Path-following for linear systems with unstable zero dynamics
: A path-following problem for linear systems with unstable zero dynamics is solved. While the original control variable steers the system output along the path, the path parameter...
Dragan B. Dacic, Petar V. Kokotovic
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
13 years 8 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 1 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...