2694 search results - page 369 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
159
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
181
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
155
click to vote
LCN
2007
IEEE
16 years 24 days ago
2007
IEEE
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
207
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
157
click to vote
GECCO
2007
Springer
16 years 20 days ago
2007
Springer
The process of development creates a phenotype from one or more genotypes of an individual through interaction with an environment. The opportunity for development to choose a phe...