X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (28) 28
computer science (24) 24
computer science, theory & methods (17) 17
computer science - data structures and algorithms (16) 16
online algorithms (16) 16
analysis (12) 12
theory of computation (10) 10
bin packing (9) 9
mathematics, applied (9) 9
algorithm analysis and problem complexity (8) 8
competitive analysis (8) 8
optimization (7) 7
bounds (6) 6
computer science, software engineering (6) 6
computer systems organization and communication networks (6) 6
online (6) 6
operations research & management science (6) 6
advice complexity (5) 5
artificial intelligence (5) 5
data structures, cryptology and information theory (5) 5
mathematics (5) 5
mathematics of computing (5) 5
on-line algorithms (5) 5
scheduling (5) 5
theoretical computer science (5) 5
competitive ratio (4) 4
complexity (4) 4
computer graphics (4) 4
engineering, manufacturing (4) 4
lower bounds (4) 4
operations research/decision theory (4) 4
randomization (4) 4
applied mathematics (3) 3
bins (3) 3
calculus of variations and optimal control; optimization (3) 3
computational theory and mathematics (3) 3
computer science, information systems (3) 3
discrete mathematics in computer science (3) 3
dual bin packing (3) 3
economics / management science (3) 3
graph coloring (3) 3
graph theory (3) 3
graphs (3) 3
irrevocability (3) 3
locality (3) 3
logics and meanings of programs (3) 3
on-line systems (3) 3
relative worst-order ratio (3) 3
seat reservation problem (3) 3
uniform processors (3) 3
worst-order ratio (3) 3
1st fit (2) 2
accommodating function (2) 2
approximation (2) 2
asymmetric string guessing (2) 2
bin covering (2) 2
combinatorial analysis (2) 2
computer communication networks (2) 2
computer networks and communications (2) 2
computer science, hardware & architecture (2) 2
covering designs (2) 2
dominating set (2) 2
dual version (2) 2
electronic books (2) 2
frequency allocation (2) 2
genomes (2) 2
greedy algorithms (2) 2
informatics (2) 2
information systems and communication service (2) 2
mathematical logic and formal languages (2) 2
mobile communication systems (2) 2
on-line (2) 2
packing (2) 2
paging (2) 2
processors (2) 2
production/logistics/supply chain (2) 2
ratio (2) 2
relative worst order ratio (2) 2
seat reservation (2) 2
semi-online (2) 2
software engineering (2) 2
software engineering/programming and operating systems (2) 2
studies (2) 2
trees (2) 2
wireless communication systems (2) 2
2 uniform machines (1) 1
accommodating sequences (1) 1
accomodating sequences (1) 1
additiv (1) 1
admission control (1) 1
advice complexity class aoc (1) 1
algorithmique (1) 1
algorithmische geometrie (1) 1
alignment (1) 1
allocations (1) 1
allokation (1) 1
aoc (1) 1
asymmetric online covering (1) 1
automobile industry (1) 1
base sequence (1) 1
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


ACM Computing Surveys (CSUR), ISSN 0360-0300, 06/2017, Volume 50, Issue 2, pp. 1 - 34
In online scenarios requests arrive over time, and each request must be serviced in an irrevocable manner before the next request arrives. Online algorithms... 
Online algorithms | approximation | advice complexity | competitive analysis | Advice complexity | Approximation | Competitive analysis | 1ST FIT | LOWER BOUNDS | COMPLEXITY | EXPLORATION | COMPUTER SCIENCE, THEORY & METHODS | COMPUTATION | FREQUENCY ALLOCATION | Surveys | Algorithms | Automobile industry
Journal Article
Theory of Computing Systems, ISSN 1432-4350, 8/2018, Volume 62, Issue 6, pp. 1443 - 1469
Recently, the first online complexity class, A O C, was introduced. The class consists of many online problems where each request must be either accepted or... 
Online algorithms | AOC | Computer Science | Weighted online problems | Advice complexity | Theory of Computation | Scheduling | MATHEMATICS | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Algorithms | Optimization | Complexity
Journal Article
ACM SIGACT News, ISSN 0163-5700, 08/2016, Volume 47, Issue 3, pp. 93 - 129
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2018, Volume 11011, pp. 216 - 230
Journal Article
Theory of Computing Systems, ISSN 1432-4350, 11/2017, Volume 61, Issue 4, pp. 1128 - 1177
Journal Article
Journal Article
Journal Article
2012, Wiley series in discrete mathematics and optimization, ISBN 9781118091371, xiv, 321
"This book provides an overview of this development as well as describes how the many different results are related"-- 
Graph theory | Graph coloring
Book
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2016, Volume 9843, pp. 179 - 190
Conference Proceeding
PLoS One, ISSN 1932-6203, 2012, Volume 7, Issue 1, p. e28272
Journal Article
Journal Article
ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 05/2007, Volume 3, Issue 2, pp. 22 - es
We define a new measure for the quality of online algorithms, the relative worst order ratio , using ideas from the max/max ratio [Ben-David and Borodin 1994]... 
relative worst order ratio | dual bin packing | quality measure | Online | bin packing | Bin packing | Quality measure | Dual bin packing | Relative worst order ratio | MATHEMATICS, APPLIED | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969, 02/2015, Volume 30, pp. 116 - 129
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 8952, pp. 181 - 192
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2015, Volume 8952, pp. 83 - 94
Conference Proceeding
Theoretical Computer Science, ISSN 0304-3975, 10/2014, Volume 556, Issue C, pp. 71 - 84
Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total... 
Online algorithms | Bin covering | Performance measures | Competitive analysis | DUAL VERSION | PACKING | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | PERFORMANCE-MEASURES | Computer science | Analysis | Algorithms | Bins | Covering | Online | Order disorder | Strength | Combinatorial analysis
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 09/2015, Volume 596, pp. 79 - 91
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.