Sciweavers

1144 search results - page 172 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
15 years 10 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
HEURISTICS
2006
120views more  HEURISTICS 2006»
14 years 9 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
TIT
2008
121views more  TIT 2008»
14 years 9 months ago
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
15 years 4 months ago
A stopping criterion based on Kalman estimation techniques with several progress indicators
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
José Luis Guerrero, Jesús Garc&iacut...
DELTA
2004
IEEE
15 years 1 months ago
Static Scheduling of Monoprocessor Real-Time Systems composed of Hard and Soft Tasks
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...