840 search results - page 126 / 168 » Inapproximability of Combinatorial Optimization Problems |
ICTAI
2010
IEEE
13 years 9 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
GLOBECOM
2008
IEEE
2008
IEEE
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
13 years 11 months ago
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
JAIR
2010
13 years 9 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
WG
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...