41 search results - page 7 / 9 » Explicit solutions for root optimization of a polynomial fam... |
160
click to vote
PODC
1999
ACM
15 years 11 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
234
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
175
click to vote
EMSOFT
2009
Springer
15 years 10 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
191
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
176
click to vote
CP
2007
Springer
16 years 23 days ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...