Výsledky vyhledávání - "Non- numerical Algorithms and Problems—Routing and layout"

Information gathering in adversarial systems: Lines and cycles

Autoři: Kishore Kothapalli Christian Scheideler The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Kishore Kothapalli Christian Scheideler The Pennsylvania State University CiteSeerX Archives

Zdroj: http://cstar.iiit.ac.in/~kkishore/gather-spaa.pdf.

Témata: Categories and Subject Descriptors F.2.8 [Analysis of Algorithms and Problem Complexity, Non- numerical Algorithms and Problems—Routing and layout, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.560.9619
http://cstar.iiit.ac.in/~kkishore/gather-spaa.pdf

Approximation Algorithms for Time-Constrained Scheduling on Line Networks ABSTRACT

Autoři: Harald Räcke Adi Rosén The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Harald Räcke Adi Rosén The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.dcs.warwick.ac.uk/~harry/pdf/linenetworks.pdf.

Témata: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network Architecture and Design—Packet-Switching Network, Store and Forward Networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Non Numerical Algorithms and Problems—Routing and Layout, Sequencing and Scheduling

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.957; http://www.dcs.warwick.ac.uk/~harry/pdf/linenetworks.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.957
http://www.dcs.warwick.ac.uk/~harry/pdf/linenetworks.pdf

Minimizing Flow Time in the Wireless Gathering Problem.

Autoři: BONIFACI, VINCENZO KORTEWEG, PETER STOUGIE, ALBERTO MARCHETTI-SPACCAMELA LEEN

Zdroj: ACM Transactions on Algorithms; 2011, Vol. 7 Issue 3, p33-33:20, 20p

Témata: WIRELESS communications, ACQUISITION of data, PACKET switching, APPROXIMATION algorithms, MATHEMATICAL proofs, DATA flow computing, POLYNOMIALS

Rate vs. Buffer Size--Greedy Information Gathering on the Line.

Autoři: ROSÉN, ADI SCALOSUB, GABRIEL

Zdroj: ACM Transactions on Algorithms; 2011, Vol. 7 Issue 3, p32-32:22, 22p

Témata: ONLINE algorithms, COMPUTER networks, COMPUTER scheduling, BUFFER storage (Computer science), COMPUTER network protocols, PACKET switching

Competitive Weighted Throughput Analysis of Greedy Protocols on DAGs.

Autoři: GORDON, EYAL ROSÉN, ADI

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 3, p50:1-50:22, 22p, 2 Diagrams, 1 Chart

Témata: BUFFER storage (Computer science), NETWORK routers, INTERNET traffic, COMPUTER network protocols, DATA packeting

Simultaneous Source Location.

Autoři: Andreev, Konstantin Garrod, Charles Golovin, Daniel a další

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p16:1-16:17, 17p, 2 Diagrams, 3 Charts

Témata: ALGORITHMS, GRAPHIC methods, GRAPH theory, DIMENSIONAL analysis, APPROXIMATION theory, FUNCTIONAL analysis

The k-Traveling Repairmen Problem.

Autoři: Fakcharoenphol, Jittat Harrelson, Chris Satish Rao

Zdroj: ACM Transactions on Algorithms; 2007, Vol. 3 Issue 4, p40.1-40.16, 16p, 7 Charts

Témata: ONLINE data processing, MACHINE theory, ALGORITHMS, ONLINE algorithms, COMPUTER programming, APPROXIMATION theory