Sciweavers

4117 search results - page 77 / 824
» On the Satisfiability of Complex Constraints
Sort
View
CSCWD
2001
Springer
15 years 10 months ago
What Complex Systems Research Can Teach Us About Collaborative Design
Collaborative design is challenging because strong interdependencies between design issues make it difficult to converge on a single design that satisfies these dependencies and i...
Mark Klein, Hiroki Sayama, Peyman Faratin, Yaneer ...
CP
2008
Springer
15 years 8 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
ECBS
1996
IEEE
93views Hardware» more  ECBS 1996»
15 years 10 months ago
A Methodology for Designing and Dimensioning Critical Complex Computing Systems
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...
Gérard Le Lann
WSCG
2000
110views more  WSCG 2000»
15 years 7 months ago
Using 3D Geometric Constraints in Architectural Design Support Systems
To support 3D architectural modeling, geometric constraints are introduced. Explicit and implicit geometric relations between building elements can be expressed by the designer an...
Bert de Vries, A. J. Jessurun, Richard H. M. C. Ke...
JUCS
2006
97views more  JUCS 2006»
15 years 6 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill