Výsledky vyhľadávania - "Graph theory—Network problems"
-
1
-
2
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: http://msrg.org/publications/pdf_files/2013/PODC13_kTCO-Brief_Announcement:_Constructing_.pdf.
Predmety: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network ArchitectureandDesign—network topology, G.2.2[Discrete Mathematics, Graph Theory—network problems General Terms Algorithms, Theory, Experimentation Keywords Overlay networks, reliability, publish/subscribe
Popis súboru: application/pdf
-
3
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, J.4 [Social and Behavioral Sciences, Economics, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms, Algorithms, Economics Additional Key Words and Phrases, Mechanism design, Recommender systems, Social networks
Popis súboru: application/pdf
-
4
Autori:
Prispievatelia:
Predmety: Categories and Subject Descriptors F.2.m [Analysis of Algorithms and Problem Complexity, Miscellaneous, G.2.2 [Discrete Mathematics, Graph Theory—Network problems, I.2.8 [Artificial Intelligence, Problem Solving, Control Methods, and Search—Heuristic methods General Terms Algorithms, Measurement, Performance Keywords Combinatorial Fitness Landscape, Local Optima Network, Local Search Heuristics
Popis súboru: application/pdf
-
5
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph theory—Network problems, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Performance Keywords, computational topology, combinatorial optimization Errors, like straws, upon the surface flow, He who would search for pearls must dive below
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.1370; http://mathcs.slu.edu/~chambers/papers/surflow.pdf
-
6
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, A.1 [Introductory and Survey, C.2.1 [Computer-Communication Networks, Network Architecture and Design – Network topology, G.2.2 [Discrete Mathematics, Graph Theory – Network Problems, General Terms, Experimentation, Reliability, Security
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.249.1511; http://arxiv.org/pdf/0908.3154v1.pdf
-
7
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: G.2.2 [Discrete Mathematics, Graph Theory graph algorithms, Graph Theory network problems General Terms Algorithms, Theory Keywords Aggregation, Distributed Algorithms, Mode, Most Frequent Element
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3839; http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf
-
8
Autori:
Prispievatelia:
Predmety: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, Graph Theory—network problems General Terms Algorithms, Theory Keywords capacities, dominating sets, distributed approximation
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.9798; http://www.cadmo.ethz.ch/as/people/alumni/fkuhn/pubs/spaa07b.pdf
-
9
Autori:
Prispievatelia:
Predmety: – Distributed networks, G.2.2 [Discrete Mathematics, Graph Theory – Network problems, Graph labeling. General Terms, Algorithms, Theory. Keywords, Compact Routing, Minor Free Graphs
Popis súboru: application/pdf
-
10
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, Graph Theory—network problems General Terms Algorithms, Theory Keywords Data Aggregation, Distributed Algorithms, In-Network Aggregation, Median, Time Complexity, Sensor Networks
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6192; http://www.tik.ee.ethz.ch/file/5a15f565006b60eac7b39b7e61885879/spaa07.pdf
-
11
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, C.2.1 [Computer- Communication Networks, Network Architecture and Design – Distributed networks, G.2.2 [Discrete Mathematics, Graph Theory – Network problems, Graph labeling. General Terms, Algorithms, Theory. Keywords, Compact Routing
-
12
Autori:
Prispievatelia:
Predmety: – Distributed networks, G.2.2 [Discrete Mathematics, Graph Theory – Network problems, Graph labeling. General Terms, Algorithms, Theory. Keywords, Compact Routing
Popis súboru: application/pdf
-
13
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: design, B.5.2 [Register-Transfer-Level Implementation, Design Aids— Optimization, G.2.2 [Discrete Mathematics, Graph Theory—Network problems
Popis súboru: application/pdf
-
14
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, C.2.1 [Computer- Communication Networks, Network Architecture and De- sign – Distributed networks, G.2.2 [Discrete Mathematics, Graph Theory – Network problems, Graph labeling. General Terms, Algorithms, Theory. Keywords, Compact Routing
Popis súboru: application/pdf
-
15
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors, C.2.1 [Computer- Communication Networks, Network Architecture and Design – Distributed networks, G.2.2 [Discrete Mathematics, Graph Theory – Network problems, Graph labeling. General Terms, Algorithms, Theory. Keywords, Compact Routing
-
16
Autori:
Prispievatelia:
Predmety: Categories and Subject Descriptors, C.2.1 [Computer- Communication Networks, Network Architecture and Design – Distributed networks, G.2.2 [Discrete Mathematics, Graph Theory – Network problems, Graph labeling. General Terms, Algorithms, Theory. Keywords, Compact Routing, Excluded Minor, Separator
-
17
Autori:
Prispievatelia:
Predmety: – Distributed networks, G.2.2 [Discrete Mathematics, Graph Theory – Network problems, Graph labeling. General Terms, Algorithms, Theory. Keywords, Compact Routing
Popis súboru: application/pdf
-
18
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: C.2.2 [Computer-communication networks, Network Protocols— Routing Protocols, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Routing and layout, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms Algorithms, Theory Keywords Sensor networks, data gathering, data fusion, routing
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.5923; http://ranger.uta.edu/~yonghe/pubs/Adaptive_Fusion_Conf.pdf
-
19
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network Architecture and Design—Store and forward networks, C.2.2 [Computer-Communication Networks, Network Protocols—Routing protocols, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms Algorithms, Performance, Theory
Popis súboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.386; http://www.uv.es/~balbelo/BBV_ipsn04.pdf
-
20
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: http://ce.sharif.ac.ir/~ghodsi/archive/Course-Materials/Advanced Algorithms/papers/Sensor Neworks/Lattice Sensor Networks Capacity Limits,Optimal.pdf.
Predmety: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network Architecture and Design—Store and forward networks, C.2.2 [Computer-Communication Networks, Network Protocols—Routing protocols, G.2.2 [Discrete Mathematics, Graph Theory—Network problems General Terms Algorithms, Performance, Theory
Popis súboru: application/pdf
Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.4843
http://ce.sharif.ac.ir/~ghodsi/archive/Course-Materials/Advanced Algorithms/papers/Sensor Neworks/Lattice Sensor Networks Capacity Limits,Optimal.pdf
Nájsť tento článok vo Web of Science