|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5911 occurrences of 2779 keywords
|
|
|
Results
Found 7529 publication records. Showing 7529 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
80 | Gideon Avigad, Jürgen Branke |
Embedded evolutionary multi-objective optimization for worst case robustness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 617-624, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
robustness, multi-objective, worst-case |
80 | Sujit Dey, Surendra Bommu |
Performance analysis of a system of communicating processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997, pp. 590-597, 1997, IEEE Computer Society / ACM, 0-8186-8200-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
PERC, accurate worst case performance analysis technique, concurrent communicating processes, exhaustive simulation, multiple communicating processes, single process descriptions, system design space, system of communicating processes, worst case performance analysis, worst case performance estimate, performance analysis, system performance, performance estimation, communicating sequential processes, system implementation, synchronization overhead, inter process communication |
76 | Reinder J. Bril, Johan J. Lukkien, Wim F. J. Verhaegh |
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 42(1-3), pp. 63-119, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Level-i active period, Level-i busy period, Worst-case occupied time, Deferred preemption, Real-time systems, Fixed-priority scheduling, Periodic tasks, Worst-case response time |
76 | Takayuki Fukuoka, Akira Tsuchiya, Hidetoshi Onodera |
Worst-case delay analysis considering the variability of transistors and interconnects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2007 International Symposium on Physical Design, ISPD 2007, Austin, Texas, USA, March 18-21, 2007, pp. 35-42, 2007, ACM, 978-1-59593-613-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
worst-case delay, interconnect, process variation |
70 | Philipp Stuermer, Anthony Bucci, Jürgen Branke, Pablo Funes, Elena Popovici |
Analysis of coevolution for worst-case optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 899-906, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
best worst-case, worst-case optimization, dynamics analysis, coevolution, minimax, coevolutionary algorithms |
68 | Jun Yan 0008, Wei Zhang 0002 |
Analyzing the worst-case execution time for instruction caches with prefetching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 8(1), pp. 7:1-7:19, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
instruction caches, hard real-time, Worst-case execution time analysis, instruction prefetching |
62 | Chris Peikert, Alon Rosen |
Lattices that admit logarithmic worst-case to average-case connection factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 478-487, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algebraic number theory, worst-case to average-case reductions, lattices |
61 | Jana Cerbáková |
Worst-case VaR and CVaR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research Proceedings 2005, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Bremen, Germany, September 7-9, 2005, pp. 817-822, 2005, 978-3-540-32537-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
moment problem, worst-case CVaR, worst-case VaR, exchange rate |
60 | Yu Liu 0037, Wei Zhang 0002 |
Exploiting stack distance to estimate worst-case data cache performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12, 2009, pp. 1979-1983, 2009, ACM, 978-1-60558-166-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
stack distance, cache, timing analysis, worst-case execution time |
60 | Nalan Gülpinar, Peter G. Harrison, Berç Rustem |
Worst-Case Analysis of Router Networks with Rival Queueing Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIS ![In: Computer and Information Sciences - ISCIS 2006, 21th International Symposium, Istanbul, Turkey, November 1-3, 2006, Proceedings, pp. 897-907, 2006, Springer, 3-540-47242-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
queueing theory, Worst-case analysis, router design |
58 | Andreas Jakoby, Christian Schindelhauer |
On the Complexity of Worst Case and Expected Time in a Circuit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 295-306, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
expected time, computational complexity, average case analysis, worst case, theory of parallel and distributed computation, timed circuits |
57 | Peter G. Bishop, Robin E. Bloomfield |
Worst Case Reliability Prediction Based on a Prior Estimate of Residual Defects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSRE ![In: 13th International Symposium on Software Reliability Engineering (ISSRE 2002), 12-15 November 2002, Annapolis, MD, USA, pp. 295-303, 2002, IEEE Computer Society, 0-7695-1763-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
worst case reliability bound, residual fault prediction, reliability prediction, reliability testing |
57 | Daniele Micciancio |
Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 9, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
worst-case/average-case connection, computational complexity, cryptography, hash functions, lattices |
55 | Yau-Tsun Steven Li, Sharad Malik, Andrew Wolfe |
Cache modeling for real-time software: beyond direct mapped instruction caches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS '96), December 4-6, 1996, Washington, DC, USA, pp. 254-263, 1996, IEEE Computer Society, 0-8186-7689-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
direct mapped instruction caches, worst case timing analysis, cache hits, set associative instruction caches, unified caches, cinderella, research, integer-linear-programming, worst case execution time, data caches, cache storage, design tool, memory performance, cache misses, real-time software, tight bound, cache modeling, hardware system |
55 | Kirill Minkovich, Jason Cong |
Mapping for better than worst-case delays in LUT-based FPGA designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: Proceedings of the ACM/SIGDA 16th International Symposium on Field Programmable Gate Arrays, FPGA 2008, Monterey, California, USA, February 24-26, 2008, pp. 56-64, 2008, ACM, 978-1-59593-934-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
better than worst-case, razor, switching probabilities, simulation, logic synthesis, technology mapping, FPGA lookup table |
55 | Antoine Mercier 0001, Pascale Minet, Laurent George 0001 |
Worst case response times in a Bluetooth piconet: scheduling combining 1-RR or E-RR with FIFO or EDF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 33(1-3), pp. 187-213, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
1-RR, E-RR, QoS, Bluetooth, EDF, FIFO, Deterministic guarantee, Worst case end-to-end response time |
55 | Matteo Corti 0002, Thomas R. Gross |
Approximation of the worst-case execution time using structural analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMSOFT ![In: EMSOFT 2004, September 27-29, 2004, Pisa, Italy, Fourth ACM International Conference On Embedded Software, Proceedings, pp. 269-277, 2004, ACM, 1-58113-860-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
worst-case execution time (WCET), structural analysis, real-time computing |
55 | Eitan Altman, Arie Hordijk |
Zero-sum Markov games and worst-case optimal control of queueing systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 21(3-4), pp. 415-447, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Zero-sum stochastic games, discounted and expected average cost, worst case control of queueing networks, value iteration, structural properties of optimal policies and value function |
54 | Jun Yan 0008, Wei Zhang 0002 |
WCET analysis of instruction caches with prefetching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES ![In: Proceedings of the 2007 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'07), San Diego, California, USA, June 13-15, 2007, pp. 175-184, 2007, ACM, 978-1-59593-632-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
instruction cache, hard real-time, worst-case execution time analysis, instruction prefetching |
53 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi |
Parameterized Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 27-51, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | C. Seshadhri 0001 |
Self-Improving Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 259-282, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Sanjoy Dasgupta, Samory Kpotufe |
Nearest Neighbor Classification and Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 403-423, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Tim Roughgarden |
Resource Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 72-92, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Uriel Feige |
Introduction to Semirandom Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 189-211, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Aravindan Vijayaraghavan |
Efficient Tensor Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 424-444, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Ankur Moitra |
Semirandom Stochastic Block Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 212-233, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Inbal Talgam-Cohen |
Prior-Independent Auctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 586-605, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan |
When Simple Hash Functions Suffice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 567-585, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Tim Roughgarden, C. Seshadhri 0001 |
Distribution-Free Models of Social Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 606-625, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Eric Price 0001 |
Sparse Recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 140-164, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Avrim Blum |
Approximation Stability and Proxy Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 120-139, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Tengyu Ma 0001 |
Why Do Local Methods Solve Nonconvex Problems? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 465-485, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Maria-Florina Balcan, Nika Haghtalab |
Noise in Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 361-381, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Daniel Dadush, Sophie Huiberts |
Smoothed Analysis of the Simplex Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 309-333, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Ilias Diakonikolas, Daniel M. Kane |
Robust High-Dimensional Statistics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 382-402, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Michael Mitzenmacher, Sergei Vassilvitskii |
Algorithms with Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 646-662, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Bodo Manthey |
Smoothed Analysis of Local Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 285-308, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Anupam Gupta 0001, Sahil Singla 0001 |
Random-Order Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 234-258, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Konstantin Makarychev, Yury Makarychev |
Perturbation Resilience. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 95-119, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Tim Roughgarden |
Distributional Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 167-188, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Jérémy Barbay |
From Adaptive Analysis to Instance Optimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 52-71, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Gregory Valiant, Paul Valiant |
Instance Optimal Distribution Testing and Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 506-526, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Maria-Florina Balcan |
Data-Driven Algorithm Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 626-645, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Heiko Röglin |
Smoothed Analysis of Pareto Curves in Multiobjective Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 334-358, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Vijay Ganesh, Moshe Y. Vardi |
On the Unreasonable Effectiveness of SAT Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 547-566, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Rong Ge 0001, Ankur Moitra |
Topic Models and Nonnegative Matrix Factorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 445-464, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Moritz Hardt |
Generalization in Overparameterized Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 486-505, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Anna R. Karlin, Elias Koutsoupias |
Beyond Competitive Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 529-546, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
53 | Tim Roughgarden |
Introduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Beyond the Worst-Case Analysis of Algorithms ![In: Beyond the Worst-Case Analysis of Algorithms, pp. 1-24, 2020, Cambridge University Press, 9781108637435. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
52 | Jikai Li, Chunming Qiao, Jinhui Xu 0001, Dahai Xu |
Maximizing throughput for optical burst switching networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(5), pp. 1163-1176, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
scheduling, OBS, worst case |
51 | Adriano Valenzano, Paolo Montuschi, Luigi Ciminiera |
Some Properties of Timed Token Medium Access Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(8), pp. 858-869, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
timed token medium access protocols, non-real-time traffic, worst-case values, average token rotation time, synchronous traffic, generic periodic pattern, heavy conditions, theoretical lower bounds, real networks, asynchronous overrun problem, multiple priority classes, worst-case assumptions, best-case assumptions, timed-token protocol parameters, network installation, protocols, throughput, local area network, real-time traffic, token networks, electronic messaging |
50 | Aduri Pavan, N. V. Vinodchandran |
Relations between Average-Case and Worst-Case Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 42(4), pp. 596-607, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Average-case complexity, Arthur-Merlin games, Worst-case complexity |
50 | Iain Bate, Guillem Bernat, G. Murphy, Peter P. Puschner |
Low-level analysis of a portable Java byte code WCET analysis framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 12-14 December 2000, Cheju Island, South Korea, pp. 39-, 2000, IEEE Computer Society, 0-7695-0930-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
low-level analysis, portable Java byte code, machine-independent program flow analysis, machine-dependent timing analysis, worst-case execution frequencies, platform-dependent information, processor pipeline, platform-independent approach, Java, timing, software performance evaluation, pipeline processing, software portability, program diagnostics, worst-case execution time analysis, program constructs |
50 | Tullio Vardanega |
Tool support for the construction of statically analysable hard real-time Ada systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS '96), December 4-6, 1996, Washington, DC, USA, pp. 129-135, 1996, IEEE Computer Society, 0-8186-7689-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
artificial satellites, statically analysable hard real time Ada systems, fixed priority process based preemptive scheduling, new generation software intensive satellite control systems, preemptive priority based scheduling, mature static analysis techniques, worst case response time analysis models, Ada programming model, worst case response time analysis tools, on-board control systems, cyclic scheduling |
50 | Hong Zhang, Tsung-Hao Chen, Ming Yuan Ting, Xin Li 0001 |
Efficient design-specific worst-case corner extraction for integrated circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 386-389, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
worst-case corner, process variation, integrated circuit |
50 | James J. Hunt, Isabel Tonin, Fridtjof Siebert |
Using global data flow analysis on bytecode to aid worst case execution time analysis for real-time Java programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JTRES ![In: Proceedings of the 6th International Workshop on Java Technologies for Real-time and Embedded Systems, JTRES 2008, 24-26 September 2008, Santa Clara, California, USA, pp. 97-105, 2008, ACM, 978-1-60558-337-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
realtime Java, verification, data flow analysis, worst case execution time, formal analysis |
50 | Steven Martin 0001, Pascale Minet |
Worst case end-to-end response times of flows scheduled with FP/FIFO. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN/ICONS/MCL ![In: Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 23-29 April 2006, Mauritius, pp. 54, 2006, IEEE Computer Society, 0-7695-2552-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
trajectory approach, FP/FIFO, QoS, real-time scheduling, Fixed priority scheduling, deterministic guarantee, worst case end-to-end response time |
50 | Thomas Lundqvist, Per Stenström |
A Method to Improve the Estimated Worst-Case Performance of Data Caching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 6th International Workshop on Real-Time Computing and Applications Symposium (RTCSA '99), 13-16 December 1999, Hong Kong, China, pp. 255-262, 1999, IEEE Computer Society, 0-7695-0306-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
predictable data structure, Real-time systems, timing analysis, worst-case execution time, cache analysis |
50 | Sijing Zhang, E. Stewart Lee |
The Worst-Case Scenario for Transmission of Synchronous Traffic in an FDDI Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 26th Conference on Local Computer Networks, Lowell, Massachusetts, USA, 17-20 October, 1999, pp. 192-201, 1999, IEEE Computer Society, 0-7695-0309-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
the timed token medium access control protocol, the worst-case situation, real-time communications, FDDI networks, synchronous messages |
50 | Sung-Kwan Kim, Sang Lyul Min, Rhan Ha |
Efficient worst case timing analysis of data caching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Real Time Technology and Applications Symposium ![In: 2nd IEEE Real-Time Technology and Applications Symposium, RTAS '96, Boston, MA, USA, June 10-12, 1996, pp. 230-240, 1996, IEEE Computer Society, 0-8186-7448-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
efficient worst case timing analysis, accurate timing analysis, pipelined execution, multiple memory locations, pointer based references, dynamic load/store instructions, WCET overestimation, global data flow analysis, benchmark programs, real-time systems, computational complexity, data caching, cache storage, instruction sets, reduced instruction set computing, data dependence analysis, cache block |
50 | Sung-Soo Lim, Young Hyun Bae, Gyu Tae Jang, Byung-Do Rhee, Sang Lyul Min, Chang Yun Park, Heonshik Shin, Kunsoo Park, Soo-Mook Moon, Chong-Sang Kim |
An Accurate Worst Case Timing Analysis for RISC Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 21(7), pp. 593-604, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
pipelined execution, real-time system, Cache memory, worst case execution time, RISC processor |
48 | Felice Balarin |
STARS of MPEG decoder: a case study in worst-case analysis of discrete-event systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES ![In: Proceedings of the Ninth International Symposium on Hardware/Software Codesign, CODES 2001, Copenhagen, Denmark, 2001, pp. 104-108, 2001, ACM, 1-58113-364-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
static analysis, worst-case analysis, system verification |
48 | Daniele Micciancio |
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 356-365, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
cyclic lattices, worst-case average-case connection, Knapsack problem, one-way functions |
48 | Guillem Bernat, Antoine Colin, Stefan M. Petters |
WCET Analysis of Probabilistic Hard Real-Time System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS'02), Austin, Texas, USA, December 3-5, 2002, pp. 279-288, 2002, IEEE Computer Society, 0-7695-1851-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
worst case execution time, probabilistic analysis, hard real-time, execution profiles |
46 | Karl Lermer, Colin J. Fidge, Ian J. Hayes |
Linear Approximation of Execution-Time Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 15(4), pp. 319-348, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Automatic constraint determination, Real-time program analysis, Worst-case and best-case execution times, Control-flow analysis, Timing prediction |
46 | Brian Towles, William J. Dally |
Worst-case traffic for oblivious routing functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 1-8, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
worst-case throughput, interconnection networks, oblivious routing |
46 | Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger |
On-line and Off-line Approximation Algorithms for Vector Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings, pp. 406-418, 1996, Springer, 3-540-61680-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Approximation algorithm, on-line algorithm, covering problem, packing problem, worst case ratio |
45 | Ravikishore Gandikota, Li Ding 0002, Peivand Tehrani, David T. Blaauw |
Worst-case aggressor-victim alignment with current-source driver models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 13-18, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
CSM, delay noise, crosstalk |
45 | David T. Blaauw, Supamas Sirichotiyakul, Chanhee Oh |
Driver modeling and alignment for worst-case delay noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 11(2), pp. 157-166, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
45 | Abhijit Dharchoudhury, Sung-Mo Kang |
Worst-case analysis and optimization of VLSI circuit performances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(4), pp. 481-492, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
45 | Chun Zhang, James F. Kurose, Donald F. Towsley, Zihui Ge, Yong Liu 0013 |
Optimal Routing with Multiple Traffic Matrices Tradeoff between Average andWorst Case Performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 13th IEEE International Conference on Network Protocols (ICNP 2005), 6-9 November 2005, Boston, MA, USA, pp. 215-224, 2005, IEEE Computer Society, 0-7695-2437-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Kelvin D. Nilsen, Hong Gao |
The real-time behavior of dynamic memory management in C++. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Real Time Technology and Applications Symposium ![In: 1st IEEE Real-Time Technology and Applications Symposium, Chicago, Illinois, USA, May 15-17, 1995, pp. 142-153, 1995, IEEE Computer Society, 0-8186-6980-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
real-time behavior, software engineering techniques, worst-case time requirements, worst-case space requirements, real-world workloads, hardware-assisted real-time garbage collection system, software engineering, real-time systems, computational complexity, flexibility, storage management, object-oriented languages, functionality, storage allocation, storage allocators, hard real-time systems, C language, real-time performance, dynamic memory management, application software, object-oriented methodologies, large software systems, C++ language |
45 | Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique, Mithuna Thottethodi |
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCA ![In: 32st International Symposium on Computer Architecture (ISCA 2005), 4-8 June 2005, Madison, Wisconsin, USA, pp. 432-443, 2005, IEEE Computer Society, 978-0-7695-2270-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Wanping Zhang, Wenjian Yu, Xiang Hu, Amirali Shayan Arani, A. Ege Engin, Chung-Kuan Cheng |
Predicting the worst-case voltage violation in a 3D power network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SLIP ![In: The 11th International Workshop on System-Level Interconnect Prediction (SLIP 2009), San Francisco, CA, USA, July 26-27, 2009, Proceedings, pp. 93-98, 2009, ACM, 978-1-60558-576-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
worst case violation prediction, integer linear programming, leakage, clock gating, power networks |
45 | Jin Ouyang, Raghuveer Raghavendra, Sibin Mohan, Tao Zhang 0032, Yuan Xie 0001, Frank Mueller 0001 |
CheckerCore: enhancing an FPGA soft core to capture worst-case execution times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2009 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2009, Grenoble, France, October 11-16, 2009, pp. 175-184, 2009, ACM. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
LEON3, checkercore, shadow pipeline, FPGA, embedded system, real-time, WCET, worst-case-execution-time, SPARC |
45 | Federico Della Croce, Vangelis Th. Paschos |
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 8(3), pp. 235-256, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Dominance conditions, Set covering, Max cut, Worst-case complexity |
45 | Wanqing Tu, Cormac J. Sreenan, Weijia Jia 0001 |
Worst-Case Delay Control in Multigroup Overlay Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 18(10), pp. 1407-1419, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Worst-case delay control, multiple groups, overlay multicast, traffic control |
45 | Erik Yu-Shing Hu, Andy J. Wellings, Guillem Bernat |
Deriving Java Virtual Machine Timing Models for Portable Worst-Case Execution Time Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OTM Workshops ![In: On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops, OTM Confederated International Workshops, HCI-SWWA, IPW, JTRES, WORM, WMS, and WRSM 2003, Catania, Sicily, Italy, November 3-7, 2003, Proceedings, pp. 411-424, 2003, Springer, 3-540-20494-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Worst-Case Execution Time (WCET) Analysis, Portable WCET, Real-Time Java |
44 | Dan Gutfreund, Amnon Ta-Shma |
Worst-Case to Average-Case Reductions Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 569-583, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Hui Xue Zhao, Serge Midonnet, Laurent George 0001 |
Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2005), 17-19 August 2005, Hong Kong, China, pp. 23-29, 2005, IEEE Computer Society, 0-7695-2346-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
non preemptive/preemptive, precedence constraint real time, fixed priority scheduling, feasibility analysis, worst case response time |
42 | Danyu Bai, Lixin Tang |
Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings, pp. 191-199, 2007, Springer, 978-3-540-73555-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Flow shop weighted completion time problem, WSPT rule, Asymptotic analysis, Worst case analysis |
41 | Jürgen Branke, Johanna Rosenbusch |
New Approaches to Coevolutionary Worst-Case Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN X, 10th International Conference Dortmund, Germany, September 13-17, 2008, Proceedings, pp. 144-153, 2008, Springer, 978-3-540-87699-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Steven Martin 0001, Pascale Minet |
Holistic and Trajectory Approaches for Distributed Non-preemptive FP/DP* Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN (1) ![In: Networking - ICN 2005, 4th International Conference on Networking, ReunionIsland, France, April 17-21, 2005, Proceedings, Part I, pp. 296-305, 2005, Springer, 3-540-25339-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
trajectory approach, QoS, Fixed priority scheduling, holistic approach, deterministic guarantee, worst case end-to-end response time |
40 | Sergiy A. Vorobyov, Haihua Chen 0001, Alex B. Gershman |
On the Relationship Between Robust Minimum Variance Beamformers With Probabilistic and Worst-Case Distortionless Response Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(11), pp. 5719-5724, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Jürgen Stohr, Alexander von Bülow, Georg Färber |
Bounding Worst-Case Access Times in Modern Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 17th Euromicro Conference on Real-Time Systems (ECRTS 2005), 6-8 July 2005, Palma de Mallorca, Spain, Proceedings, pp. 189-198, 2005, IEEE Computer Society, 0-7695-2400-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Taehyoun Kim, Naehyuck Chang, Heonshik Shin |
Bounding Worst Case Garbage Collection Time for Embedded Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Real Time Technology and Applications Symposium ![In: Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium, RTAS 2000, Washington, DC, USA, May 31 - June 2, 2000, pp. 46-55, 2000, IEEE Computer Society, 0-7695-0713-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
live memory analysis, garbage collection, embedded real-time systems, memory requirement |
40 | Kurt Antreich, Helmut E. Graeb, Claudia U. Wieser |
Circuit analysis and optimization driven by worst-case distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(1), pp. 57-71, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
40 | Chansik Im, K. H. (Kane) Kim |
A Hybrid Approach in TADE for Derivation of Execution Time Bounds of Program-Segments in Distributed Real-Time Embedded Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISORC ![In: Ninth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2006), 24-26 April 2006, Gyeongju, Korea, pp. 408-418, 2006, IEEE Computer Society, 0-7695-2561-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
worst-case execution path, program-segment, methodsegment, acyclic path-segment, path enumeration, curvefitting, execution time bound, TETB, real time, measurement, analysis, hybrid, worst-case execution time |
40 | Lars Arge, Jeffrey Scott Vitter |
Optimal Dynamic Interval Management in External Memory (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 560-569, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
optimal dynamic interval management, space-optimal external-memory data structure, I/O-optimal external-memory data structure, stabbing query answering, dynamically maintained intervals, I/O algorithms, 2D range searching, optimal linear space, optimal I/O query bound, optimal I/O update bound, worst-case update bounds, balancing technique, worst-case balanced tree manipulation, databases, object-oriented databases, temporal databases, storage management, constraint logic programming, external memory |
40 | David J. Aldous, Umesh V. Vazirani |
"Go With the Winners" Algorithms ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 492-501, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
worst case running time, Go with the winners, randomized optimization algorithms, rigorous analysis, deep leaf, probability of success, searching, tree, worst-case |
40 | Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan |
Dynamic Perfect Hashing: Upper and Lower Bounds ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 524-531, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
dynamic perfect hashing, amortized expected time, amortized worst-case time complexity, lower bounds, randomized algorithm, upper bounds, deterministic algorithm, insertion, deletion, lookup, worst-case time, dictionary problem |
40 | Mohamed Ali Aloulou, Christian Artigues |
Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings. Part III, pp. 1027-1036, 2007, Springer, 978-3-540-74482-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Rohit Sunkam Ramanujam, Bill Lin 0001 |
Near-optimal oblivious routing on three-dimensional mesh networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 26th International Conference on Computer Design, ICCD 2008, 12-15 October 2008, Lake Tahoe, CA, USA, Proceedings, pp. 134-141, 2008, IEEE Computer Society, 978-1-4244-2657-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Lili Tan |
The worst-case execution time tool challenge 2006. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 11(2), pp. 133-152, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Embedded systems, Timing analysis, Worst-case execution time, WCET, Hard real time |
39 | Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David B. Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller 0001, Isabelle Puaut, Peter P. Puschner, Jan Staschulat, Per Stenström |
The worst-case execution-time problem - overview of methods and survey of tools. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 7(3), pp. 36:1-36:53, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
worst-case execution times, Hard real time |
39 | Christian Ferdinand, Reinhold Heckmann |
Worst-Case Execution Time - A Tool Provider's Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISORC ![In: 11th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2008), 5-7 May 2008, Orlando, Florida, USA, pp. 340-345, 2008, IEEE Computer Society, 978-0-7695-3132-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
WCET worst-case execution time prediction |
39 | Raimund Kirner, Peter P. Puschner |
Obstacles in Worst-Case Execution Time Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISORC ![In: 11th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2008), 5-7 May 2008, Orlando, Florida, USA, pp. 333-339, 2008, IEEE Computer Society, 978-0-7695-3132-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
measurement-based timing analysis, static analysis, WCET, worst-case execution time analysis |
39 | Hiroshi Nakashima, Masahiro Konishi, Takashi Nakada |
An accurate and efficient simulation-based analysis for worst case interruption delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2006 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2006, Seoul, Korea, October 22-25, 2006, pp. 2-12, 2006, ACM, 1-59593-543-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
worst case interruption delay, cycle accurate simulation |
39 | Jiaxing Sun, Yun Zheng, Qing Ye, Tianchun Ye 0001 |
Worst-Case Crosstalk Noise Analysis Based on Dual-Exponential Noise Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 18th International Conference on VLSI Design (VLSI Design 2005), with the 4th International Conference on Embedded Systems Design, 3-7 January 2005, Kolkata, India, pp. 348-353, 2005, IEEE Computer Society, 0-7695-2264-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
crosstalk noise metrics, peak noise window, worst-case crosstalk noise, crosstalk noise |
39 | Tobias Schüle, Klaus Schneider 0001 |
Abstraction of assembler programs for symbolic worst case execution time analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 41th Design Automation Conference, DAC 2004, San Diego, CA, USA, June 7-11, 2004, pp. 107-112, 2004, ACM, 1-58113-828-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
program slicing assembler programs, real-time systems, abstraction, worst case execution time, symbolic simulation |
Displaying result #1 - #100 of 7529 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|