Sciweavers

4536 search results - page 201 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
A Randomized Sorting Algorithm on the BSP model
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
Alexandros V. Gerbessiotis, Constantinos J. Siniol...
COCOON
1999
Springer
14 years 1 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
14 years 2 months ago
Optimisation of Reaction Mechanisms for Aviation Fuels Using a Multi-objective Genetic Algorithm
In this study a multi-objective genetic algorithm approach is developed for determining new reaction rate parameters for the combustion of kerosene/air mixtures. The multi-objectiv...
Lionel Elliott, Derek B. Ingham, Adrian G. Kyne, N...
SODA
2004
ACM
108views Algorithms» more  SODA 2004»
13 years 11 months ago
A certifying algorithm for the consecutive-ones property
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
Ross M. McConnell
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 7 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld