Sciweavers

1650 search results - page 186 / 330
» The HOM problem is decidable
Sort
View
131
Voted
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
16 years 1 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein
134
Voted
FOSSACS
2009
Springer
15 years 11 months ago
Interrupt Timed Automata
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...
Béatrice Bérard, Serge Haddad
ICRA
2007
IEEE
175views Robotics» more  ICRA 2007»
15 years 11 months ago
A Decision-Making Framework for Control Strategies in Probabilistic Search
Abstract— This paper presents the search problem formulated as a decision problem, where the searcher decides whether the target is present in the search region, and if so, where...
Timothy H. Chung, Joel W. Burdick
COCOON
2005
Springer
15 years 10 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
David Liben-Nowell, Erik Vee, An Zhu
FOSSACS
2005
Springer
15 years 10 months ago
Fault Diagnosis Using Timed Automata
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has...
Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza