Sciweavers

4432 search results - page 7 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
KBSE
2010
IEEE
13 years 7 months ago
Apt-pbo: solving the software dependency problem using pseudo-boolean optimization
The installation of software packages depends on the correct resolution of dependencies and conflicts between packages. This problem is NP-complete and, as expected, is a hard ta...
Paulo Trezentos, Inês Lynce, Arlindo L. Oliv...
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
14 years 7 days ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
SAC
2005
ACM
14 years 2 months ago
A multi-agent approach for solving optimization problems involving expensive resources
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserabl...
Hoong Chuin Lau, Hui Wang
ATAL
2004
Springer
14 years 1 months ago
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...
Roger Mailler, Victor R. Lesser