Sciweavers

749 search results - page 107 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
MOBIHOC
2004
ACM
15 years 10 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 5 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
FOCI
2007
IEEE
15 years 5 months ago
A New Reduction from 3SAT to n-Partite Graphs
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
Daniel J. Hulme, Robin Hirsch, Bernard F. Buxton, ...
GLOBECOM
2006
IEEE
15 years 5 months ago
Optimal Resource Allocation via Geometric Programming for OFDM Broadcast and Multiple Access Channels
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...
Kibeom Seong, David D. Yu, Youngjae Kim, John M. C...
CP
2003
Springer
15 years 4 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano