Sciweavers

71228 search results - page 64 / 14246
» Algorithms
Sort
View
ICCSA
2005
Springer
15 years 6 months ago
Evolutionary Algorithm for Congestion Problem in Connection-Oriented Networks
The major objective of this paper is to deploy an effective evolutionary algorithm (EA) for the congestion problem in connection-oriented networks. The network flow is modeled as n...
Michal Przewozniczek, Krzysztof Walkowiak
SWAT
2004
Springer
123views Algorithms» more  SWAT 2004»
15 years 6 months ago
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...
ICASSP
2009
IEEE
15 years 5 months ago
Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
Ziad Naja, Florence Alberge, Pierre Duhamel
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
15 years 2 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
STOC
2007
ACM
104views Algorithms» more  STOC 2007»
16 years 1 months ago
Simple deterministic approximation algorithms for counting matchings
Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, C...