Sciweavers

4117 search results - page 47 / 824
» On the Satisfiability of Complex Constraints
Sort
View
INFOCOM
2012
IEEE
13 years 2 months ago
Resource allocation for heterogeneous multiuser OFDM-based cognitive radio networks with imperfect spectrum sensing
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...
Shaowei Wang, Zhi-Hua Zhou, Mengyao Ge, Chonggang ...
AI
2004
Springer
15 years 5 months ago
Constraint Satisfaction Methods for Information Personalization
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
Syed Sibte Raza Abidi, Yong Han Chong
AAAI
2004
15 years 1 months ago
The Complexity of Global Constraints
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
Christian Bessière, Emmanuel Hebrard, Brahi...
IJCAI
1993
15 years 1 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
AAAI
1994
15 years 1 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara