Sciweavers

195 search results - page 37 / 39
» cor 2008
Sort
View
COR
2008
122views more  COR 2008»
13 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
COR
2008
99views more  COR 2008»
13 years 7 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
COR
2008
116views more  COR 2008»
13 years 7 months ago
Supply disruptions with time-dependent parameters
We consider a firm that faces random demand and receives product from a single supplier who faces random supply. The supplier's availability may be affected by events such as...
Andrew M. Ross, Ying Rong, Lawrence V. Snyder
MICRO
2008
IEEE
159views Hardware» more  MICRO 2008»
14 years 2 months ago
Copy or Discard execution model for speculative parallelization on multicores
The advent of multicores presents a promising opportunity for speeding up sequential programs via profile-based speculative parallelization of these programs. In this paper we pr...
Chen Tian, Min Feng, Vijay Nagarajan, Rajiv Gupta