Sciweavers

7 search results - page 1 / 2
» On the coordinator's rule for Fast Paxos
Sort
View
IPL
2008
77views more  IPL 2008»
13 years 5 months ago
On the coordinator's rule for Fast Paxos
Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value v that is consistent with all past rounds. Rounds are start...
Gustavo M. D. Vieira, Luiz Eduardo Buzato
IWPSE
2003
IEEE
13 years 10 months ago
Using Coordination Contracts for Flexible Adaptation to Changing Business Rules
This paper reports on the use of coordination contracts, presented at the previous two IWPSE workshops, in a project for a credit recovery company. We have designed and implemente...
Michel Wermelinger, Georgios Koutsoukos, Richard A...
IJRR
2007
80views more  IJRR 2007»
13 years 5 months ago
Fast Laser Scan Matching using Polar Coordinates
In this paper a novel Polar Scan Matching (PSM) approach is described that works in the laser scanner’s polar coordinate system, therefore taking advantage of the structure of t...
Albert Diosi, Lindsay Kleeman
HM
2005
Springer
140views Optimization» more  HM 2005»
13 years 11 months ago
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
Herman Sontrop, Pieter van der Horn, Marc Uetz
CEC
2008
IEEE
13 years 11 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...