Výsledky vyhledávání - "Algorithms|analysis of algorithms General Terms"

Convex quadratic and semidefinite programming relaxations in scheduling

Autoři: Martin Skutella The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Martin Skutella The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.math.tu-berlin.de/~skutella/skut-jacm.pdf.

Témata: Optimization—convex programming, G.2.0 [Discrete mathematics, General, G.3 [Probability and statistics, probabilistic algorithms (including Monte Carlo, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—analysis of algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Approximation algorithms, convex optimization, performance guarantee, randomized algorithms, scheduling theory, unrelated machines, worst-case ratio

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.5275

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.5275
http://www.math.tu-berlin.de/~skutella/skut-jacm.pdf

Optimal control dependence computation and the Roman chariots problem

Autoři: Keshav Pingali The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Keshav Pingali The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.utexas.edu/users/pingali/CS380C/2007fa/papers/roman.pdf.

Témata: Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors|compilers and optimization, I.1.2 [Algebraic Manipulation, Algorithms|analysis of algorithms General Terms, Algorithms, Languages, Theory Additional Key Words and Phrases, Compilers, control dependence, program optimization, pro- gram

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.581.2938; http://www.cs.utexas.edu/users/pingali/CS380C/2007fa/papers/roman.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.581.2938
http://www.cs.utexas.edu/users/pingali/CS380C/2007fa/papers/roman.pdf

A Lower Bound on the Average-Case Complexity of Shellsort

Autoři: Tao Jiang Ming Li Paul Vitányi a další

Přispěvatelé: Tao Jiang Ming Li Paul Vitányi a další

Zdroj: http://www.cwi.nl/~paulv/papers/shellsort.pdf.

Témata: Nonnumerical Algorithms and Problems—sorting and searching, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—analysis of algorithms General Terms, Algorithms, Performance, Theory Additional Key Words and Phrases, Average-case complexity, computational complexity, Kolmogorov complexity, shellsort, sorting

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.6508; http://www.cwi.nl/~paulv/papers/shellsort.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.6508
http://www.cwi.nl/~paulv/papers/shellsort.pdf

On the Matrix Berlekamp-Massey Algorithm.

Autoři: KALTOFEN, ERICH YUHASZ, GEORGE

Zdroj: ACM Transactions on Algorithms; Sep2013, Vol. 9 Issue 4, p1-24, 24p

Témata: BERLEKAMP-Massey algorithm, MATHEMATICAL sequences, POLYNOMIALS, MULTIVARIATE analysis, LINEAR control systems, MATHEMATICAL bounds, COMPUTATIONAL complexity

Optimal Base Station Placement in Wireless Sensor Networks.

Autoři: Yi Shi Hou, Y. Thomas

Zdroj: ACM Transactions on Sensor Networks; Nov2009, Vol. 5 Issue 4, p32-32.24, 24p, 4 Diagrams, 4 Charts, 5 Graphs

Témata: WIRELESS sensor networks, WIRELESS communications, ALGORITHMS, SENSOR networks, ENERGY consumption, ENERGY management, ENERGY conservation, SECURITY systems, ENGINEERING instruments