Sciweavers

365 search results - page 24 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
14 years 1 months ago
Asynchronous gossip algorithms for stochastic optimization
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
MOBIHOC
2001
ACM
14 years 8 months ago
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kind...
Deepak Ganesan, Ramesh Govindan, Scott Shenker, De...
NFM
2011
303views Formal Methods» more  NFM 2011»
13 years 3 months ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
GD
2004
Springer
14 years 1 months ago
Visual Navigation of Compound Graphs
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
Marcus Raitner
INFFUS
2006
103views more  INFFUS 2006»
13 years 8 months ago
Information fusion approaches to the automatic pronunciation of print by analogy
Automatic pronunciation of words from their spelling alone is a hard computational problem, especially for languages like English and French where there is only a partially consis...
Robert I. Damper, Yannick Marchand