Sciweavers

1352 search results - page 46 / 271
» An algorithm for minimizing the Mumford-Shah functional
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...
DAGSTUHL
2004
13 years 10 months ago
Optimal algorithms for global optimization in case of unknown Lipschitz constant
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
Matthias U. Horn
MASCOTS
2003
13 years 10 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
14 years 2 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
FOCS
2008
IEEE
14 years 3 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer