Sciweavers

1095 search results - page 57 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
109
Voted
ICPP
1992
IEEE
15 years 6 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss
STACS
2012
Springer
13 years 10 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
159
Voted
SCP
1998
163views more  SCP 1998»
15 years 2 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
PPSN
1998
Springer
15 years 6 months ago
A Decoder-Based Evolutionary Algorithm for Constrained Parameter Optimization Problems
Several methods have been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; a survey paper [7] provides an overview of var...
Slawomir Koziel, Zbigniew Michalewicz
139
Voted
PPSN
1994
Springer
15 years 6 months ago
Convergence Models of Genetic Algorithm Selection Schemes
We discuss the use of normal distribution theory as a tool to model the convergence characteristics of di erent GA selection schemes. The models predict the proportion of optimal a...
Dirk Thierens, David E. Goldberg