The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase worst-case (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1962-1975 (16) 1976-1977 (16) 1978-1980 (19) 1981-1982 (19) 1983-1984 (23) 1985 (33) 1986 (23) 1987 (23) 1988 (44) 1989 (43) 1990 (58) 1991 (42) 1992 (75) 1993 (91) 1994 (97) 1995 (108) 1996 (116) 1997 (120) 1998 (132) 1999 (209) 2000 (241) 2001 (232) 2002 (271) 2003 (379) 2004 (411) 2005 (565) 2006 (578) 2007 (581) 2008 (626) 2009 (435) 2010 (176) 2011 (96) 2012 (120) 2013 (133) 2014 (123) 2015 (109) 2016 (113) 2017 (131) 2018 (126) 2019 (120) 2020 (151) 2021 (141) 2022 (160) 2023 (171) 2024 (33)
Publication types (Num. hits)
article(2436) book(2) incollection(43) inproceedings(4974) phdthesis(57) proceedings(17)
Venues (Conferences, Journals, ...)
CoRR(349) WCET(217) SODA(109) DAC(99) IEEE Trans. Comput. Aided Des....(95) ESA(89) IEEE Trans. Computers(88) RTSS(84) ECRTS(78) ISAAC(77) FOCS(76) DATE(72) J. ACM(72) SCG(70) Algorithmica(64) ICALP(63) More (+10 of total 1403)
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
80Gideon Avigad, Jürgen Branke Embedded evolutionary multi-objective optimization for worst case robustness. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF robustness, multi-objective, worst-case
80Sujit Dey, Surendra Bommu Performance analysis of a system of communicating processes. Search on Bibsonomy ICCAD The full citation details ... 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
76Reinder 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 Real Time Syst. The full citation details ... 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
76Takayuki Fukuoka, Akira Tsuchiya, Hidetoshi Onodera Worst-case delay analysis considering the variability of transistors and interconnects. Search on Bibsonomy ISPD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF worst-case delay, interconnect, process variation
70Philipp Stuermer, Anthony Bucci, Jürgen Branke, Pablo Funes, Elena Popovici Analysis of coevolution for worst-case optimization. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF best worst-case, worst-case optimization, dynamics analysis, coevolution, minimax, coevolutionary algorithms
68Jun Yan 0008, Wei Zhang 0002 Analyzing the worst-case execution time for instruction caches with prefetching. Search on Bibsonomy ACM Trans. Embed. Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF instruction caches, hard real-time, Worst-case execution time analysis, instruction prefetching
62Chris Peikert, Alon Rosen Lattices that admit logarithmic worst-case to average-case connection factors. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF algebraic number theory, worst-case to average-case reductions, lattices
61Jana Cerbáková Worst-case VaR and CVaR. Search on Bibsonomy OR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF moment problem, worst-case CVaR, worst-case VaR, exchange rate
60Yu Liu 0037, Wei Zhang 0002 Exploiting stack distance to estimate worst-case data cache performance. Search on Bibsonomy SAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF stack distance, cache, timing analysis, worst-case execution time
60Nalan Gülpinar, Peter G. Harrison, Berç Rustem Worst-Case Analysis of Router Networks with Rival Queueing Models. Search on Bibsonomy ISCIS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF queueing theory, Worst-case analysis, router design
58Andreas Jakoby, Christian Schindelhauer On the Complexity of Worst Case and Expected Time in a Circuit. Search on Bibsonomy STACS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF expected time, computational complexity, average case analysis, worst case, theory of parallel and distributed computation, timed circuits
57Peter G. Bishop, Robin E. Bloomfield Worst Case Reliability Prediction Based on a Prior Estimate of Residual Defects. Search on Bibsonomy ISSRE The full citation details ... 2002 DBLP  DOI  BibTeX  RDF worst case reliability bound, residual fault prediction, reliability prediction, reliability testing
57Daniele Micciancio Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF worst-case/average-case connection, computational complexity, cryptography, hash functions, lattices
55Yau-Tsun Steven Li, Sharad Malik, Andrew Wolfe Cache modeling for real-time software: beyond direct mapped instruction caches. Search on Bibsonomy RTSS The full citation details ... 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
55Kirill Minkovich, Jason Cong Mapping for better than worst-case delays in LUT-based FPGA designs. Search on Bibsonomy FPGA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF better than worst-case, razor, switching probabilities, simulation, logic synthesis, technology mapping, FPGA lookup table
55Antoine 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 Telecommun. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 1-RR, E-RR, QoS, Bluetooth, EDF, FIFO, Deterministic guarantee, Worst case end-to-end response time
55Matteo Corti 0002, Thomas R. Gross Approximation of the worst-case execution time using structural analysis. Search on Bibsonomy EMSOFT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF worst-case execution time (WCET), structural analysis, real-time computing
55Eitan Altman, Arie Hordijk Zero-sum Markov games and worst-case optimal control of queueing systems. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 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
54Jun Yan 0008, Wei Zhang 0002 WCET analysis of instruction caches with prefetching. Search on Bibsonomy LCTES The full citation details ... 2007 DBLP  DOI  BibTeX  RDF instruction cache, hard real-time, worst-case execution time analysis, instruction prefetching
53Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Parameterized Algorithms. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53C. Seshadhri 0001 Self-Improving Algorithms. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Sanjoy Dasgupta, Samory Kpotufe Nearest Neighbor Classification and Search. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Tim Roughgarden Resource Augmentation. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Uriel Feige Introduction to Semirandom Models. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Aravindan Vijayaraghavan Efficient Tensor Decompositions. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Ankur Moitra Semirandom Stochastic Block Models. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Inbal Talgam-Cohen Prior-Independent Auctions. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan When Simple Hash Functions Suffice. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Tim Roughgarden, C. Seshadhri 0001 Distribution-Free Models of Social Networks. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Eric Price 0001 Sparse Recovery. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Avrim Blum Approximation Stability and Proxy Objectives. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Tengyu Ma 0001 Why Do Local Methods Solve Nonconvex Problems? Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Maria-Florina Balcan, Nika Haghtalab Noise in Classification. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Daniel Dadush, Sophie Huiberts Smoothed Analysis of the Simplex Method. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Ilias Diakonikolas, Daniel M. Kane Robust High-Dimensional Statistics. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Michael Mitzenmacher, Sergei Vassilvitskii Algorithms with Predictions. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Bodo Manthey Smoothed Analysis of Local Search. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Anupam Gupta 0001, Sahil Singla 0001 Random-Order Models. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Konstantin Makarychev, Yury Makarychev Perturbation Resilience. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Tim Roughgarden Distributional Analysis. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Jérémy Barbay From Adaptive Analysis to Instance Optimality. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Gregory Valiant, Paul Valiant Instance Optimal Distribution Testing and Learning. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Maria-Florina Balcan Data-Driven Algorithm Design. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Heiko Röglin Smoothed Analysis of Pareto Curves in Multiobjective Optimization. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Vijay Ganesh, Moshe Y. Vardi On the Unreasonable Effectiveness of SAT Solvers. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Rong Ge 0001, Ankur Moitra Topic Models and Nonnegative Matrix Factorization. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Moritz Hardt Generalization in Overparameterized Models. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Anna R. Karlin, Elias Koutsoupias Beyond Competitive Analysis. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
53Tim Roughgarden Introduction. Search on Bibsonomy Beyond the Worst-Case Analysis of Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
52Jikai Li, Chunming Qiao, Jinhui Xu 0001, Dahai Xu Maximizing throughput for optical burst switching networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF scheduling, OBS, worst case
51Adriano Valenzano, Paolo Montuschi, Luigi Ciminiera Some Properties of Timed Token Medium Access Protocols. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 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
50Aduri Pavan, N. V. Vinodchandran Relations between Average-Case and Worst-Case Complexity. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Average-case complexity, Arthur-Merlin games, Worst-case complexity
50Iain Bate, Guillem Bernat, G. Murphy, Peter P. Puschner Low-level analysis of a portable Java byte code WCET analysis framework. Search on Bibsonomy RTCSA The full citation details ... 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
50Tullio Vardanega Tool support for the construction of statically analysable hard real-time Ada systems. Search on Bibsonomy RTSS The full citation details ... 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
50Hong Zhang, Tsung-Hao Chen, Ming Yuan Ting, Xin Li 0001 Efficient design-specific worst-case corner extraction for integrated circuits. Search on Bibsonomy DAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF worst-case corner, process variation, integrated circuit
50James 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 JTRES The full citation details ... 2008 DBLP  DOI  BibTeX  RDF realtime Java, verification, data flow analysis, worst case execution time, formal analysis
50Steven Martin 0001, Pascale Minet Worst case end-to-end response times of flows scheduled with FP/FIFO. Search on Bibsonomy ICN/ICONS/MCL The full citation details ... 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
50Thomas Lundqvist, Per Stenström A Method to Improve the Estimated Worst-Case Performance of Data Caching. Search on Bibsonomy RTCSA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF predictable data structure, Real-time systems, timing analysis, worst-case execution time, cache analysis
50Sijing Zhang, E. Stewart Lee The Worst-Case Scenario for Transmission of Synchronous Traffic in an FDDI Network. Search on Bibsonomy LCN The full citation details ... 1999 DBLP  DOI  BibTeX  RDF the timed token medium access control protocol, the worst-case situation, real-time communications, FDDI networks, synchronous messages
50Sung-Kwan Kim, Sang Lyul Min, Rhan Ha Efficient worst case timing analysis of data caching. Search on Bibsonomy IEEE Real Time Technology and Applications Symposium The full citation details ... 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
50Sung-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 IEEE Trans. Software Eng. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF pipelined execution, real-time system, Cache memory, worst case execution time, RISC processor
48Felice Balarin STARS of MPEG decoder: a case study in worst-case analysis of discrete-event systems. Search on Bibsonomy CODES The full citation details ... 2001 DBLP  DOI  BibTeX  RDF static analysis, worst-case analysis, system verification
48Daniele Micciancio Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF cyclic lattices, worst-case average-case connection, Knapsack problem, one-way functions
48Guillem Bernat, Antoine Colin, Stefan M. Petters WCET Analysis of Probabilistic Hard Real-Time System. Search on Bibsonomy RTSS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF worst case execution time, probabilistic analysis, hard real-time, execution profiles
46Karl Lermer, Colin J. Fidge, Ian J. Hayes Linear Approximation of Execution-Time Constraints. Search on Bibsonomy Formal Aspects Comput. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Automatic constraint determination, Real-time program analysis, Worst-case and best-case execution times, Control-flow analysis, Timing prediction
46Brian Towles, William J. Dally Worst-case traffic for oblivious routing functions. Search on Bibsonomy SPAA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF worst-case throughput, interconnection networks, oblivious routing
46Noga 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 ESA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Approximation algorithm, on-line algorithm, covering problem, packing problem, worst case ratio
45Ravikishore Gandikota, Li Ding 0002, Peivand Tehrani, David T. Blaauw Worst-case aggressor-victim alignment with current-source driver models. Search on Bibsonomy DAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF CSM, delay noise, crosstalk
45David T. Blaauw, Supamas Sirichotiyakul, Chanhee Oh Driver modeling and alignment for worst-case delay noise. Search on Bibsonomy IEEE Trans. Very Large Scale Integr. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
45Abhijit Dharchoudhury, Sung-Mo Kang Worst-case analysis and optimization of VLSI circuit performances. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
45Chun 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 ICNP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Kelvin D. Nilsen, Hong Gao The real-time behavior of dynamic memory management in C++. Search on Bibsonomy IEEE Real Time Technology and Applications Symposium The full citation details ... 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
45Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique, Mithuna Thottethodi Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks. Search on Bibsonomy ISCA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Wanping 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 SLIP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF worst case violation prediction, integer linear programming, leakage, clock gating, power networks
45Jin 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 CASES The full citation details ... 2009 DBLP  DOI  BibTeX  RDF LEON3, checkercore, shadow pipeline, FPGA, embedded system, real-time, WCET, worst-case-execution-time, SPARC
45Federico Della Croce, Vangelis Th. Paschos Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems. Search on Bibsonomy Oper. Res. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Dominance conditions, Set covering, Max cut, Worst-case complexity
45Wanqing Tu, Cormac J. Sreenan, Weijia Jia 0001 Worst-Case Delay Control in Multigroup Overlay Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Worst-case delay control, multiple groups, overlay multicast, traffic control
45Erik Yu-Shing Hu, Andy J. Wellings, Guillem Bernat Deriving Java Virtual Machine Timing Models for Portable Worst-Case Execution Time Analysis. Search on Bibsonomy OTM Workshops The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Worst-Case Execution Time (WCET) Analysis, Portable WCET, Real-Time Java
44Dan Gutfreund, Amnon Ta-Shma Worst-Case to Average-Case Reductions Revisited. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
43Hui 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 RTCSA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF non preemptive/preemptive, precedence constraint real time, fixed priority scheduling, feasibility analysis, worst case response time
42Danyu Bai, Lixin Tang Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem. Search on Bibsonomy COCOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Flow shop weighted completion time problem, WSPT rule, Asymptotic analysis, Worst case analysis
41Jürgen Branke, Johanna Rosenbusch New Approaches to Coevolutionary Worst-Case Optimization. Search on Bibsonomy PPSN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
41Steven Martin 0001, Pascale Minet Holistic and Trajectory Approaches for Distributed Non-preemptive FP/DP* Scheduling. Search on Bibsonomy ICN (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF trajectory approach, QoS, Fixed priority scheduling, holistic approach, deterministic guarantee, worst case end-to-end response time
40Sergiy 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 IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Jürgen Stohr, Alexander von Bülow, Georg Färber Bounding Worst-Case Access Times in Modern Multiprocessor Systems. Search on Bibsonomy ECRTS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
40Taehyoun Kim, Naehyuck Chang, Heonshik Shin Bounding Worst Case Garbage Collection Time for Embedded Real-Time Systems. Search on Bibsonomy IEEE Real Time Technology and Applications Symposium The full citation details ... 2000 DBLP  DOI  BibTeX  RDF live memory analysis, garbage collection, embedded real-time systems, memory requirement
40Kurt Antreich, Helmut E. Graeb, Claudia U. Wieser Circuit analysis and optimization driven by worst-case distances. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
40Chansik 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 ISORC The full citation details ... 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
40Lars Arge, Jeffrey Scott Vitter Optimal Dynamic Interval Management in External Memory (extended abstract). Search on Bibsonomy FOCS The full citation details ... 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
40David J. Aldous, Umesh V. Vazirani "Go With the Winners" Algorithms Search on Bibsonomy FOCS The full citation details ... 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
40Martin 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 FOCS The full citation details ... 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
40Mohamed Ali Aloulou, Christian Artigues Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems. Search on Bibsonomy ICCSA (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Rohit Sunkam Ramanujam, Bill Lin 0001 Near-optimal oblivious routing on three-dimensional mesh networks. Search on Bibsonomy ICCD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
39Lili Tan The worst-case execution time tool challenge 2006. Search on Bibsonomy Int. J. Softw. Tools Technol. Transf. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Embedded systems, Timing analysis, Worst-case execution time, WCET, Hard real time
39Reinhard 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 ACM Trans. Embed. Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF worst-case execution times, Hard real time
39Christian Ferdinand, Reinhold Heckmann Worst-Case Execution Time - A Tool Provider's Perspective. Search on Bibsonomy ISORC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF WCET worst-case execution time prediction
39Raimund Kirner, Peter P. Puschner Obstacles in Worst-Case Execution Time Analysis. Search on Bibsonomy ISORC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF measurement-based timing analysis, static analysis, WCET, worst-case execution time analysis
39Hiroshi Nakashima, Masahiro Konishi, Takashi Nakada An accurate and efficient simulation-based analysis for worst case interruption delay. Search on Bibsonomy CASES The full citation details ... 2006 DBLP  DOI  BibTeX  RDF worst case interruption delay, cycle accurate simulation
39Jiaxing Sun, Yun Zheng, Qing Ye, Tianchun Ye 0001 Worst-Case Crosstalk Noise Analysis Based on Dual-Exponential Noise Metrics. Search on Bibsonomy VLSI Design The full citation details ... 2005 DBLP  DOI  BibTeX  RDF crosstalk noise metrics, peak noise window, worst-case crosstalk noise, crosstalk noise
39Tobias Schüle, Klaus Schneider 0001 Abstraction of assembler programs for symbolic worst case execution time analysis. Search on Bibsonomy DAC The full citation details ... 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][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license