Sciweavers

11371 search results - page 127 / 2275
» The network inhibition problem
Sort
View
CISS
2008
IEEE
16 years 29 days ago
Revisiting the optimal scheduling problem
— In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the ...
Sastry Kompella, Jeffrey E. Wieselthier, Anthony E...
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
16 years 18 days ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
JVA
2006
IEEE
16 years 15 days ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 10 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
CC
2006
Springer
108views System Software» more  CC 2006»
15 years 10 months ago
A Fresh Look at PRE as a Maximum Flow Problem
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
Jingling Xue, Jens Knoop