Sciweavers

995 search results - page 83 / 199
» Wire-speed total order
Sort
View
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 10 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
RIVF
2003
13 years 10 months ago
MAF: Un Protocole de Multicast Fiable
— This paper describes the design and implementation of a novel reliable multicast protocol, totally reliable and scalable to large number of receivers. MAF relies on Active Netw...
Prométhée Spathis, Kim Loan Thai
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 10 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
Mugurel Ionut Andreica
IJAIT
2008
146views more  IJAIT 2008»
13 years 8 months ago
Learning to Behave in Space: a Qualitative Spatial Representation for Robot Navigation with Reinforcement Learning
ion mechanism to create a representation of space consisting of the circular order of detected landmarks and the relative position of walls towards the agent's moving directio...
Lutz Frommberger