Sciweavers

312 search results - page 14 / 63
» On k-optimal distributed constraint optimization algorithms:...
Sort
View
CLUSTER
2001
IEEE
14 years 13 days ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 3 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...
ATS
2001
IEEE
126views Hardware» more  ATS 2001»
14 years 13 days ago
Design of an Optimal Test Access Architecture Using a Genetic Algorithm
Test access is a major problem for core-based systemon-chip (SOC) designs. Since cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms...
Zahra Sadat Ebadi, André Ivanov

Presentation
956views
12 years 2 months ago
A Method for Distributed Computaion of Semi-Optimal Multicast Tree in MANET
In this paper, we propose a new method to construct a semi-optimal QoS-aware multicast tree on MANET using distributed computation of the tree based on Genetic Algorithm (GA). This...
JSAT
2006
88views more  JSAT 2006»
13 years 8 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva