Sciweavers

4430 search results - page 197 / 886
» Solving Optimization Problems with DLL
Sort
View
DIS
2000
Springer
15 years 11 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,...
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
15 years 1 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 11 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
PPOPP
2005
ACM
16 years 3 days ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
JPDC
2006
133views more  JPDC 2006»
15 years 6 months ago
Grid computing for parallel bioinspired algorithms
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
Nouredine Melab, Sébastien Cahon, El-Ghazal...