Sciweavers

392 search results - page 13 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...
Franck Butelle, Mourad Hakem, Lucian Finta
CONCUR
2006
Springer
13 years 10 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
CONCUR
1997
Springer
13 years 11 months ago
Modularity for Timed and Hybrid Systems
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
Rajeev Alur, Thomas A. Henzinger
CIKM
2008
Springer
13 years 8 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao
PODC
2010
ACM
13 years 10 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes