Sciweavers

1969 search results - page 79 / 394
» Incremental Processing and Acceptability
Sort
View
135
Voted
DAC
2005
ACM
15 years 7 months ago
TCAM enabled on-chip logic minimization
This paper presents an efficient hardware architecture of an on-chip logic minimization coprocessor. The proposed architecture employs TCAM cells to provide fastest and memory eļ¬...
Seraj Ahmad, Rabi N. Mahapatra
CONCUR
2008
Springer
15 years 7 months ago
R-Automata
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
Parosh Aziz Abdulla, Pavel Krcál, Wang Yi
AI
2007
Springer
15 years 5 months ago
Iterated belief revision, revised
The AGM postulates for belief revision, augmented by the DP postulates for iterated belief revision, provide generally accepted criteria for the design of operators by which intel...
Yi Jin, Michael Thielscher
CIE
2009
Springer
15 years 12 months ago
On Stateless Multicounter Machines
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine has m-counters operating on a one-way input delimited by left a...
Ömer Egecioglu, Oscar H. Ibarra
142
Voted
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
16 years 5 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...