Sciweavers

274 search results - page 2 / 55
» An Experimental Study of LP-Based Approximation Algorithms f...
Sort
View
ACST
2006
13 years 7 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
ANOR
2004
116views more  ANOR 2004»
13 years 6 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ICCAD
2007
IEEE
160views Hardware» more  ICCAD 2007»
14 years 3 months ago
Approximation algorithm for the temperature-aware scheduling problem
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
Sushu Zhang, Karam S. Chatha
SLS
2007
Springer
120views Algorithms» more  SLS 2007»
14 years 10 days ago
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
Benoît Laurent, Jin-Kao Hao
TON
2010
127views more  TON 2010»
13 years 28 days ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi