Sciweavers

437 search results - page 29 / 88
» Gradience, Constructions and Constraint Systems
Sort
View
CP
2009
Springer
14 years 9 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
AIPS
1994
13 years 10 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
EPIA
2003
Springer
14 years 2 months ago
jcc: Integrating Timed Default Concurrent Constraint Programming into Java
Abstract. This paper describes jcc, an integration of the timed default concurrent constraint programming framework [16] (Timed Default cc) into JAVA [7]. jcc is intended for use i...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
CP
2009
Springer
14 years 9 months ago
Propagator Groups
This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constr...
Mikael Z. Lagerkvist, Christian Schulte
NA
2010
82views more  NA 2010»
13 years 7 months ago
Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
Matthew M. Lin, Bo Dong, Moody T. Chu