Sciweavers

4432 search results - page 190 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
112
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
152
Voted
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 9 months ago
A new evolutionary model for detecting multiple optima
Multimodal optimization problems consist in detecting all global and local optima of a problem. A new evolutionary approach to multimodal optimization called Roaming technique (RO...
Rodica Ioana Lung, D. Dumitrescu
150
Voted
DIS
2000
Springer
15 years 7 months ago
A Practical Algorithm to Find the Best Subsequence Patterns
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara,...
148
Voted
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
14 years 10 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
15 years 8 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma