Sciweavers

5055 search results - page 328 / 1011
» Relative Timing
Sort
View
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
15 years 7 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 7 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
CLEIEJ
2006
87views more  CLEIEJ 2006»
15 years 7 months ago
Integrity Constraint Checking in Distributed Nested Transactions over a Database Cluster
This paper presents a solution to check referential integrity constraints and conjunctive global constraints in a relational multi database system. It also presents the experiment...
Stéphane Gançarski, Claudia Le&oacut...
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 7 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi
CSL
2006
Springer
15 years 7 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin