Sciweavers

3367 search results - page 192 / 674
» Incremental assignment problem
Sort
View
119
Voted
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 3 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart
SWARM
2012
SPRINGER
329views Optimization» more  SWARM 2012»
13 years 11 months ago
A critical analysis of parameter adaptation in ant colony optimization
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
Paola Pellegrini, Thomas Stützle, Mauro Birat...
148
Voted
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
15 years 9 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
133
Voted
ICDCIT
2004
Springer
15 years 8 months ago
Distributing Key Updates in Secure Dynamic Groups
We focus on the problem of distributing key updates in secure dynamic groups. Due to changes in group membership, the group controller needs to change and distribute the keys used...
Sandeep S. Kulkarni, Bezawada Bruhadeshwar
115
Voted
TON
1998
145views more  TON 1998»
15 years 3 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu