CEC

2005

IEEE

13 years 11 months ago
2005

IEEE

The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...

GECCO

2006

Springer

14 years 22 days ago
2006

Springer

Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...

SAC

2003

ACM

14 years 2 months ago
2003

ACM

Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...

AICCSA

2005

IEEE

14 years 2 months ago
2005

IEEE

We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...

WEA

2010

Springer

14 years 3 months ago
2010

Springer

Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...