Sciweavers

14548 search results - page 104 / 2910
» The Optimal Path-Matching Problem
Sort
View
LSSC
2007
Springer
14 years 4 months ago
Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
Stefka Fidanova
WICON
2008
13 years 11 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
ICASSP
2007
IEEE
14 years 4 months ago
Multiple View Region Matching as a Lagrangian Optimization Problem
A method to establish correspondences between regions belonging to independent segmentations of multiple views of a scene is presented. The trade-off between color similarity and ...
Felipe Calderero, Ferran Marqués, Antonio O...
CDC
2008
IEEE
175views Control Systems» more  CDC 2008»
14 years 4 months ago
Transformation of optimal control problems with a state constraint avoiding interior boundary conditions
— A well–known problem in constrained optimal control is the presence of interior boundary conditions for constrained arcs which require a–priori knowledge of the optimal sol...
Knut Graichen, Nicolas Petit, Andreas Kugi
IPPS
2007
IEEE
14 years 4 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...