Sciweavers

980 search results - page 157 / 196
» Decentralized Constraint Satisfaction
Sort
View
CORR
2007
Springer
63views Education» more  CORR 2007»
13 years 9 months ago
Optimizing the SINR operating point of spatial networks
— This paper addresses the following question, which is of interest in the design and deployment of a multiuser decentralized network. Given a total system bandwidth of W Hz and ...
Nihar Jindal, Jeffrey G. Andrews, Steven Weber
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 9 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 2 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
AI
2010
Springer
13 years 9 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
LATIN
2010
Springer
13 years 7 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen