Sciweavers

1650 search results - page 52 / 330
» The HOM problem is decidable
Sort
View
IJACTAICIT
2010
185views more  IJACTAICIT 2010»
13 years 5 months ago
Adaptive Bandwidth Allocation Scheme for Cognitive Radios
In recent past, cognitive radio has come out to as a promising solution to the spectrum scarcity problem. It tends to increase the spectrum utilization by making use of underutili...
Prabhjot Kaur, Moin Uddin, Arun Khosla
CORR
2012
Springer
185views Education» more  CORR 2012»
12 years 3 months ago
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...
Johannes Textor, Maciej Liskiewicz
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 5 months ago
Balanced Interval Coloring
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
Antonios Antoniadis, Falk Hüffner, Pascal Len...
AAAI
2000
13 years 9 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
CSR
2007
Springer
14 years 1 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen