Sciweavers

1968 search results - page 86 / 394
» The Complexity of Valued Constraint Models
Sort
View
ER
2007
Springer
137views Database» more  ER 2007»
15 years 7 months ago
Prioritized Preferences and Choice Constraints
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental is...
Wilfred Ng
CP
2006
Springer
15 years 5 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
CIE
2006
Springer
15 years 5 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
ICCAD
2006
IEEE
134views Hardware» more  ICCAD 2006»
15 years 10 months ago
A delay fault model for at-speed fault simulation and test generation
We describe a transition fault model, which is easy to simulate under test sequences that are applied at-speed, and provides a target for the generation of at-speed test sequences...
Irith Pomeranz, Sudhakar M. Reddy
COMPLEXITY
2007
151views more  COMPLEXITY 2007»
15 years 1 months ago
From complex conflicts to stable cooperation: Cases in environment and security
: Conflict is a dynamic and complex form of human interaction, often emerging from incompatible actions, values and goals, and consuming a considerable amount of resources. Conflic...
Jürgen Scheffran, Bruce Hannon