10901 search results - page 238 / 2181 » Approximations in Distributed Optimization |
164
click to vote
ESWS
2005
Springer
16 years 3 days ago
2005
Springer
When information services are organized to provide some composed functionality, their interactions can be formally represented as workflows. Traditionally, workflows are executed...
268
click to vote
ACPC
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. Its main goal is to provide pa...
179
click to vote
IJCAI
2007
15 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
153
click to vote
AAAI
2006
15 years 8 months ago
2006
Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multiagent coordination. However, despite agent privacy being a key motivation for appl...
174
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Consider a distributed system with n nodes where each node holds a multiset of items. In this paper, we design sampling algorithms that allow us to estimate the global frequency...