Sciweavers

982 search results - page 66 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
CCCG
2010
14 years 11 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
CPAIOR
2010
Springer
15 years 2 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
ISMVL
2006
IEEE
109views Hardware» more  ISMVL 2006»
15 years 4 months ago
Towards Solving Many-Valued MaxSAT
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
Josep Argelich, Xavier Domingo, Chu Min Li, Felip ...
JDA
2007
97views more  JDA 2007»
14 years 10 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
ICC
2007
IEEE
155views Communications» more  ICC 2007»
15 years 4 months ago
On Supporting Robust Voice Multicasting Over Ad Hoc Wireless Networks
Abstract— In this paper, we address the problem of voice multicasting in ad hoc wireless networks. The unique characteristics of voice traffic (viz. small packet size, high pack...
G. Venkat Raju, Tamma Bheemarjuna Reddy, C. Siva R...