221 search results - page 33 / 45 » Duality in Optimization and Constraint Satisfaction |
TWC
2008
13 years 7 months ago
2008
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
COR
2006
13 years 7 months ago
2006
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
AI
2010
Springer
13 years 7 months ago
2010
Springer
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...