5214 search results - page 255 / 1043 » The Online Specialization Problem |
167
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
183
Voted
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
207
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
176
click to vote
HIS
2008
15 years 8 months ago
2008
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...
186
Voted
ICRA
2005
IEEE
16 years 8 days ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...