Výsledky vyhledávání - Nonnumerical Algorithms and Problems— sequencing and scheduling
-
1
Autoři: a další
Přispěvatelé: a další
Témata: complexity, bi-criteria optimization, algorithms, scheduling
Popis souboru: application/pdf
-
2
Autoři: a další
Zdroj: 2007 ACM/IEEE Conference on Supercomputing-SC'07, Reno, NV, USA, 10-16 Nov. 2007
info:cnr-pdr/source/autori:Capannini G.; Baraglia R.; Puppin D.; Ricci L.; Pasquali M./congresso_nome:2007 ACM%2FIEEE Conference on Supercomputing-SC'07/congresso_luogo:Reno, NV, USA/congresso_data:10-16 Nov. 2007/anno:2007/pagina_da:/pagina_a:/intervallo_pagineTémata: Job scheduling, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Nonnumerical Algorithms and Problems-Sequencing, 01 natural sciences
Popis souboru: application/pdf
Přístupová URL adresa: http://www.di.unipi.it/~ricci/pdfpapers/SC2007.pdf
https://core.ac.uk/display/54909505
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005348791
http://portal.acm.org/citation.cfm?doid=1362622.1362695
http://doi.org/10.1145/1362622.1362695
https://dl.acm.org/doi/10.1145/1362622.1362695 -
3
Autoři:
Přispěvatelé:
Zdroj: http://algo.epfl.ch/~osven/Ola Svensson_publications/JACM11.pdf.
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling General Terms, Algorithms, Theory Additional Key Words and Phrases, Job shop scheduling, hardness of approximation, machine scheduling ACM Reference Format
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.4865; http://algo.epfl.ch/~osven/Ola Svensson_publications/JACM11.pdf
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.4865
http://algo.epfl.ch/~osven/Ola Svensson_publications/JACM11.pdf -
4
Autoři:
Zdroj: Discrete Applied Mathematics. 123:339-361
Témata: Printed circuit boards, Business & economic sciences, Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming, 0209 industrial biotechnology, Scheduling, Deterministic scheduling theory in operations research, Applied Mathematics, production planning, 0211 other engineering and technologies, Production planning, sequencing, 02 engineering and technology, integer programming models, Applications of mathematical programming, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), Production, distribution & gestion de la chaîne logistique, Sequencing, printed circuit boards, Discrete Mathematics and Combinatorics, Production, distribution & supply chain management, Integer programming models, scheduling, Production models, Sciences économiques & de gestion
Popis souboru: application/xml
Přístupová URL adresa: https://zbmath.org/1801736
https://doi.org/10.1016/s0166-218x(01)00345-6
https://www.sciencedirect.com/science/article/abs/pii/S0166218X01003456
https://www.sciencedirect.com/science/article/pii/S0166218X01003456
https://dblp.uni-trier.de/db/journals/dam/dam123.html#CramaKS02
https://dl.acm.org/doi/10.1016/S0166-218X%2801%2900345-6
https://orbi.uliege.be/handle/2268/1730
https://dl.acm.org/citation.cfm?id=772382.772392 -
5
Autoři: a další
Přispěvatelé: a další
Zdroj: Annals of Mathematics and Artificial Intelligence. 39:1-18
Témata: real time, flexible computation, IA, contract algorithms, 7. Clean energy, real-time problem solving, mathematical foundation, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], meta-level control, AI, mata-level control, temps reel, Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.), Nonnumerical algorithms, algorithmes par contrat
Popis souboru: application/xml
Přístupová URL adresa: https://inria.hal.science/inria-00099720v1
https://doi.org/10.1023/a:1024412831598
https://inria.hal.science/inria-00108057v1
http://scholarworks.umass.edu/cs_faculty_pubs/1313/
https://dblp.uni-trier.de/db/journals/amai/amai39.html#ZilbersteinCC03
https://link.springer.com/content/pdf/10.1023%252FA%253A1024412831598.pdf
https://hal.inria.fr/inria-00099720
https://link.springer.com/article/10.1023/A:1024412831598 -
6
Autoři: a další
Přispěvatelé: a další
Témata: [INFO.INFO-DC]Computer Science [cs]/Distributed, and Cluster Computing [cs.DC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.5: Sequencing and scheduling, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Parallel
Přístupová URL adresa: https://inria.hal.science/inria-00344035v1
-
7
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems- Sequencing and Scheduling General Terms Algorithm, Performance
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.6510; http://www.cs.utexas.edu/users/plaxton/pubs/2006/spaa.pdf
-
8
Autoři:
Přispěvatelé:
Témata: General Terms, Design, Economics, Theory Keywords, mechanism design, task scheduling, truthful
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.9447; http://www.cs.wayne.edu/~dgrosu/pub/podc05.pdf
-
9
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analyis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Variable-speed processor, flow time, online algorithms, competitive analysis, offline algorithms, dynamic programming ACM Reference Format
Popis souboru: application/pdf
-
10
Autoři: a další
Přispěvatelé: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783319096971
Témata: ddc:004, Data processing Computer science, Models of Computation (F.4.1), Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), Classes defined by grammars or automata (e.g., context-free languages, regular sets, recursive sets), 0102 computer and information sciences, 02 engineering and technology, Routing and layout, 01 natural sciences, Classes defined by resource-bounded automata, Algebraic language theory, Self-modifying machines (e.g., neural networks), Relations among complexity classes, 0202 electrical engineering, electronic engineering, information engineering, Decision problems, Pattern matching, Complexity of proof procedures, Bounded-action devices (e.g., Turing machines, random access machines), Machine-independent complexity, computational complexity, Automata (e.g., finite, push-down, resource-bounded), Formal Languages (D.3.1), almost-equivalence, 4. Education, Relations between models, hyper-minimization, Computability theory, 16. Peace & justice, Reducibility and completeness, Geometrical problems and computations, Relations among complexity measures, Operations on languages, Computations on discrete structures, Sorting and searching, Sequencing and scheduling, biautomata, Complexity hierarchies, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3)
Popis souboru: application/pdf
Přístupová URL adresa: http://geb.uni-giessen.de/geb/volltexte/2014/11056/pdf/Ifig_Report1401.pdf
http://www.informatik.uni-giessen.de/reports/Report1401.pdf
https://link.springer.com/chapter/10.1007/978-3-319-09698-8_26
https://rd.springer.com/chapter/10.1007/978-3-319-09698-8_26
http://geb.uni-giessen.de/geb/volltexte/2014/11056/ -
11
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, B.7 [Hardware, Integrated Circuits, B.7.2 [Integrated Circuits, Design Aids, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—sequencing and scheduling General Terms, Algorithms, Design, Experimentation Additional Key Words and Phrases, Crossings, VLSI layout
Popis souboru: application/pdf
-
12
Autoři: a další
Přispěvatelé: a další
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.2928; http://www.cs.pitt.edu/~kirk/cs3150spring2010/spaa2008.pdf
-
13
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors—code gener- at~on, optwnization, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—sequencing and scheduling General Terms. Algorithms Additional, Compiler optimization, deadline, greedy algorith
Popis souboru: application/pdf
-
14
Autoři:
Přispěvatelé:
Témata: low power, power-aware scheduling
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.767; http://faculty.knox.edu/dbunde/pubs/poweraware.pdf
-
15
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling General Terms, Algorithms Additional Key Words and Phrases, Speed scaling, voltage scaling, frequency scaling, scheduling, power management
Popis souboru: application/pdf
-
16
Autoři: a další
Přispěvatelé: a další
Témata: and concurrency, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—reducibility and completeness, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—sequencing and scheduling General Terms, Algorithms, Performance, The
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.670; http://www.cs.yale.edu/publications/techreports/tr1423.pdf
-
17
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors C.2.5 [Computer-Communication Networks, Local and Wide- Area Networks—Access schemes, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling General Terms Algorithms, Reliability, Theory Keywords Wireless Ad-hoc Networks, MAC Protocols, Jamming
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.2961; http://www.public.asu.edu/%7Earicha/mypapers/mobihoc11.pdf
-
18
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors C.2.5 [Computer-Communication Networks, Local and Wide- Area Networks—Access schemes, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling General Terms Algorithms, Reliability, Theory Keywords wireless ad-hoc networks, MAC protocols, jamming
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.4375; http://www.public.asu.edu/~aricha/mypapers/podc08.pdf
-
19
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors D.1.3 [Programming Techniques, Concurrent Programming, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling General Terms Algorithms, Theory Keywords Software transactional memory, Transactions, Contention
Popis souboru: application/pdf
-
20
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors, B.5.2 [Register-Transfer-Level Implementation, Design Aids, D.3.4 [Programming Languages, Processors—compilers, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—sequencing and scheduling General Terms, Algorithms, Design, Experimentation, Performance, Reliability, Theory Additional Key Words and Phrases, Linear schedule, multicluster VLIW, systolic array
Popis souboru: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder