Sciweavers

2252 search results - page 275 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
131
Voted
TSP
2008
114views more  TSP 2008»
15 years 3 months ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer
156
Voted
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 1 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
116
Voted
TOMS
2011
101views more  TOMS 2011»
14 years 10 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
151
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
A Distributed Optimization Algorithm for Multi-Hop Cognitive Radio Networks
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...
Yi Shi, Y. Thomas Hou
114
Voted
ICRA
2003
IEEE
143views Robotics» more  ICRA 2003»
15 years 9 months ago
Cooperative task planning of multi-robot systems with temporal constraints
This paper discusses a design methodology of cooperative trajectory generation for multi-robot systems. The trajectory of achieving cooperative tasks, i.e., with temporal constrai...
Feng-Li Lian, Richard M. Murray