Sciweavers

4277 search results - page 309 / 856
» On Multiple Linear Approximations
Sort
View
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
15 years 11 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
ICASSP
2009
IEEE
15 years 6 months ago
Extended VTS for noise-robust speech recognition
Model compensation is a standard way of improving the robustness of speech recognition systems to noise. A number of popular schemes are based on vector Taylor series (vts) compen...
Rogier C. van Dalen, Mark J. F. Gales
NIPS
2001
15 years 21 days ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
15 years 13 days ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
TAMC
2009
Springer
15 years 3 months ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo