Sciweavers

1968 search results - page 50 / 394
» The Complexity of Valued Constraint Models
Sort
View
ATAL
2007
Springer
15 years 7 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 2 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
AAAI
2006
15 years 2 months ago
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
Christian Bessière, Remi Coletta, Fré...
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
14 years 8 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
VL
2003
IEEE
139views Visual Languages» more  VL 2003»
15 years 6 months ago
Visualizing design patterns with a UML profile
In this paper, we present a UML profile which defines new stereotypes, tagged values and constraints for visualizing design patterns in UML diagrams. These new stereotypes and tag...
Jing Dong, Sheng Yang