291 search results - page 6 / 59 » Constraint Satisfaction: The Approximability of Minimization... |
158
click to vote
ADHOCNOW
2008
Springer
15 years 12 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
127
click to vote
CONSTRAINTS
2007
15 years 5 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
183
click to vote
CONSTRAINTS
2008
15 years 5 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
136
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
160
click to vote
MOBIQUITOUS
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...