Sciweavers

1074 search results - page 151 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Aggregate Threshold Queries in Sensor Networks
— An important class of queries over sensor networks are network-wide aggregation queries. In this work we study a class of aggregation queries which we refer to as aggregate thr...
Izchak Sharfman, Assaf Schuster, Daniel Keren
TSP
2008
179views more  TSP 2008»
14 years 9 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 1 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
DCC
2004
IEEE
15 years 9 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...
SRDS
2006
IEEE
15 years 3 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring