Sciweavers

2109 search results - page 123 / 422
» Solving Necklace Constraint Problems
Sort
View
149
Voted
DS
1997
104views Database» more  DS 1997»
15 years 6 months ago
Managing Constraint Violations in Administrative Information Systems
This paper motivates a comprehensive methodological framework for dealing with some aspects of real-world complexity in information system analysis and design. By complex applicat...
I. Boydens, Alain Pirotte, Esteban Zimányi
AI
2002
Springer
15 years 5 months ago
Multi-agent oriented constraint satisfaction
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional...
Jiming Liu, Han Jing, Yuan Yan Tang
146
Voted
AUSAI
2006
Springer
15 years 8 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 ...
IV
2003
IEEE
98views Visualization» more  IV 2003»
15 years 10 months ago
A new approach to virtual design for spatial configuration problems
In this paper, we present a new framework for the use of Virtual Reality (VR) in engineering design for configuration applications. Traditional VR systems support the visual explo...
Carlos Calderon, Marc Cavazza, Daniel Diaz
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 10 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...