Sciweavers

2694 search results - page 206 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
164
Voted
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
15 years 11 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
MOBIHOC
2008
ACM
16 years 5 months ago
Toward stochastic anatomy of inter-meeting time distribution under general mobility models
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...
Han Cai, Do Young Eun
ICASSP
2010
IEEE
15 years 6 months ago
Efficient weighted-sum-rate maximization for a class of half-duplex cooperative systems
In many half-duplex cooperative systems, the direct formulation of the problem of finding the jointly optimal power and channel resource allocation that maximizes a weighted sum ...
Wessam Mesbah, Timothy N. Davidson
ICML
2009
IEEE
16 years 7 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
JMLR
2010
125views more  JMLR 2010»
15 years 1 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...