2694 search results - page 122 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
284
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
128
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
149
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
241
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
151
click to vote
AIPS
2006
15 years 6 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...