Sciweavers

391 search results - page 30 / 79
» Sortabilities of Partition Properties
Sort
View
97
Voted
ASPDAC
2005
ACM
90views Hardware» more  ASPDAC 2005»
15 years 2 months ago
Feasibility analysis of messages for on-chip networks using wormhole routing
—The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing propert...
Zhonghai Lu, Axel Jantsch, Ingo Sander
94
Voted
CONCUR
1999
Springer
15 years 5 months ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi
QEST
2010
IEEE
14 years 10 months ago
Canonical Form Based MAP(2) Fitting
The importance of the order two Markovian arrival process (MAP(2)) comes from its compactness, serving either as arrival or service process in applications, and from the nice prope...
Levente Bodrog, Peter Buchholz, Jan Kriege, Mikl&o...
112
Voted
ICDE
2010
IEEE
379views Database» more  ICDE 2010»
16 years 13 days ago
Osprey: Implementing MapReduce-Style Fault Tolerance in a Shared-Nothing Distributed Database
In this paper, we describe a scheme for tolerating and recovering from mid-query faults in a distributed shared nothing database. Rather than aborting and restarting queries, our s...
Christopher Yang, Christine Yen, Ceryen Tan, Samue...
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
15 years 22 days ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos