Sciweavers

4066 search results - page 8 / 814
» Almost Complete Sets
Sort
View
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
15 years 6 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
IJCAI
1989
15 years 28 days ago
Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds
Mechanical systems, of the kinds which are of interest for qualitative reasoning, are characterized by a set of real-valued parameters, each of which is a piecewise continuous fun...
Erik Sandewall
ECCC
2011
282views ECommerce» more  ECCC 2011»
14 years 6 months ago
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
Noga Alon, Shachar Lovett
92
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 1 days ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
JSYML
2006
62views more  JSYML 2006»
14 years 11 months ago
Uniform almost everywhere domination
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
Peter Cholak, Noam Greenberg, Joseph S. Miller