Sciweavers

26 search results - page 5 / 6
» ipl 2000
Sort
View
101
Voted
IPL
2000
115views more  IPL 2000»
15 years 1 days ago
Randomized uniform self-stabilizing mutual exclusion
Abstract. The mutual exclusion protocol presented ensures that whatever perturbation the network undergo, it regains consistency in nite time: one and only one privilege token is p...
Jérôme Olivier Durand-Lose
97
Voted
IPL
2000
69views more  IPL 2000»
15 years 1 days ago
Generating all maximal models of a Boolean expression
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
Dimitris J. Kavvadias, Martha Sideri, Elias C. Sta...
85
Voted
IPL
2000
77views more  IPL 2000»
15 years 1 days ago
Efficient loopless generation of Gray codes for k-ary trees
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
Limin Xiang, Kazuo Ushijima, Changjie Tang
95
Voted
IPL
2000
74views more  IPL 2000»
15 years 1 days ago
A new universal and fault-tolerant quantum basis
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environ...
P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P....
100
Voted
IPL
2000
111views more  IPL 2000»
15 years 1 days ago
On the performance of the first-fit coloring algorithm on permutation graphs
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
Stavros D. Nikolopoulos, Charis Papadopoulos