Sciweavers

IPL
2008
77views more  IPL 2008»
13 years 4 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
IPL
2008
145views more  IPL 2008»
13 years 4 months ago
Complexity analysis of a decentralised graph colouring algorithm
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov
IPL
2008
80views more  IPL 2008»
13 years 4 months ago
Path partitions of hypercubes
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
Petr Gregor, Tomás Dvorák
IPL
2008
102views more  IPL 2008»
13 years 4 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
IPL
2008
103views more  IPL 2008»
13 years 4 months ago
New efficiency results for makespan cost sharing
In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agen...
Yvonne Bleischwitz, Florian Schoppmann
IPL
2008
82views more  IPL 2008»
13 years 4 months ago
Confusion of memory
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
Lawrence S. Moss
IPL
2008
70views more  IPL 2008»
13 years 4 months ago
Minimum-perimeter enclosures
We give efficient algorithms for computing a minimum-perimeter k-gon that encloses a given n-gon. Key words: Computational Geometry, Polygon Optimization
Joseph S. B. Mitchell, Valentin Polishchuk
IPL
2008
105views more  IPL 2008»
13 years 4 months ago
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
Mario A. Lopez, Shlomo Reisner
IPL
2008
109views more  IPL 2008»
13 years 4 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
IPL
2008
79views more  IPL 2008»
13 years 4 months ago
On the efficient construction of quasi-reversible automata for reversible languages
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
Pedro García, Manuel Vazquez de Parga, Dami...