Sciweavers

982 search results - page 179 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
AI
1999
Springer
13 years 7 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
IAT
2010
IEEE
13 years 5 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
SMI
2008
IEEE
181views Image Analysis» more  SMI 2008»
14 years 2 months ago
Example based skeletonization using harmonic one-forms
This paper presents a method to extract skeletons using examples. Our method is based on the observation that many deformations in real world applications are isometric or near is...
Ying He 0001, Xian Xiao, Hock Soon Seah
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 1 months ago
Takeover time curves in random and small-world structured populations
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
Mario Giacobini, Marco Tomassini, Andrea Tettamanz...