Result 1 to 20 of 351 total
Box-basket-ball systems. (English)
Rev. Math. Phys. 24, No. 8, 1250019,23p. (2012).
1
Online flow time scheduling in the presence of preemption overhead. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 85-97 (2012).
2
Inverse problem in cylindrical electrical networks. (English)
SIAM J. Appl. Math. 72, No. 3, 767-788 (2012).
3
Non-clairvoyant weighted flow time scheduling on different multi-processor models. (English)
Solis-Oba, Roberto (ed.) et al., Approximation and online algorithms. 9th international workshop, WAOA 2011, Saarbrücken, Germany, September 8‒9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-29115-9/pbk). Lecture Notes in Computer Science 7164, 137-149 (2012).
4
Continuous monitoring of distributed data streams over a time-based sliding window. (English)
Algorithmica 62, No. 3-4, 1088-1111 (2012).
5
Memory efficient algorithms for structural alignment of rnas with pseudoknots (English)
IEEE/ACM Trans. Comput. Biology Bioinform. 9, No. 1, 161-168 (2012).
6
The use of coevolution and the artificial immune system for ensemble learning. (English)
Soft Comput. 15, No. 9, 1735-1747 (2011).
7
Scheduling for weighted flow time and energy with rejection penalty. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 392-403, electronic only (2011).
8
A linear size index for approximate pattern matching. (English)
J. Discrete Algorithms 9, No. 4, 358-364 (2011).
9
Edit distance to monotonicity in sliding windows. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 564-573 (2011).
10
Nonclairvoyant speed scaling for flow and energy. (English)
Algorithmica 61, No. 3, 507-517 (2011).
11
Cache-oblivious index for approximate string matching. (English)
Theor. Comput. Sci. 412, No. 29, 3579-3588 (2011).
12
Sleep management on multiple machines for energy and flow time. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 219-231 (2011).
13
Energy-efficient due date scheduling. (English)
Marchetti-Spaccamela, Alberto (ed.) et al., Theory and practice of algorithms in (computer) systems. First international ICST conference, TAPAS 2011, Rome, Italy, April 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19753-6/pbk). Lecture Notes in Computer Science 6595, 69-80 (2011).
14
Online tracking of the dominance relationship of distributed multi-dimensional data. (English)
Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9‒10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 178-189 (2011).
15
Tradeoff between energy and throughput for online deadline scheduling. (English)
Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9‒10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 59-70 (2011).
16
Gait flow image: a silhouette-based gait representation for human identification. (English)
Pattern Recognition 44, No. 4, 973-987 (2011).
17
DMEA: a direction-based multiobjective evolutionary algorithm (English)
Memetic Computing 3, No. 4, 271-285 (2011).
18
An explicit iterative algorithm for a class of variational inequalities in Hilbert spaces (English)
J. Optimization Theory and Applications 151, No. 3, 513-524 (2011).
19
Approximating frequent items in asynchronous data stream over a sliding window (English)
Algorithms 4, No. 3, 200-222 (2011).
20
Result 1 to 20 of 351 total