Sciweavers

18306 search results - page 175 / 3662
» Algorithmics in Exponential Time
Sort
View
88
Voted
DLT
2010
14 years 11 months ago
On a Powerful Class of Non-universal P Systems with Active Membranes
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
Antonio E. Porreca, Alberto Leporati, Claudio Zand...
66
Voted
APJOR
2010
107views more  APJOR 2010»
14 years 10 months ago
Mean Value Analysis of Single Server retrial Queues
Mean value analysis is an elegant tool for determining mean performance measures in queueing models. We use the technique to analyze the M/G/1 retrial queue with exponential retri...
Jesus R. Artalejo, J. A. C. Resing
IPL
2008
79views more  IPL 2008»
14 years 10 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...
81
Voted
SWAT
2004
Springer
123views Algorithms» more  SWAT 2004»
15 years 3 months ago
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...
LADC
2011
Springer
14 years 1 months ago
Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms
—We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We sho...
Fatemeh Borran, Martin Hutle, André Schiper