Sciweavers

16093 search results - page 381 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 11 months ago
Black-box optimization benchmarking for noiseless function testbed using PSO_bounds
This paper benchmarks the particle swarm optimizer with adaptive bounds algorithm (PSO Bounds) on the noisefree BBOB 2009 testbed. The algorithm is further augmented with a simple...
Mohammed El-Abd, Mohamed S. Kamel
INFOCOM
2005
IEEE
16 years 14 days ago
Optimal utility based multi-user throughput allocation subject to throughput constraints
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
Matthew Andrews, Lijun Qian, Alexander L. Stolyar
ATAL
2010
Springer
15 years 7 months ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...
SIAMCO
2002
121views more  SIAMCO 2002»
15 years 6 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
TIT
2010
141views Education» more  TIT 2010»
15 years 1 months ago
Distributed averaging via lifted Markov chains
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
Kyomin Jung, Devavrat Shah, Jinwoo Shin