16091 search results - page 56 / 3219 » Solving |
CP
2003
Springer
14 years 27 days ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
DESRIST
2009
Springer
14 years 9 days ago
2009
Springer
Design science emphasizes the connection between knowledge and practice by showing that we can produce scientific knowledge by designing useful things. However, without further g...
CP
2001
Springer
14 years 6 days ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
CP
2001
Springer
14 years 6 days ago
2001
Springer
In interactive graphical applications we often require that objects do not overlap. Such non-overlap constraints can be modelled as disjunctions of arithmetic inequalities. Unfortu...
DATE
1999
IEEE
14 years 7 hour ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...