Search results for "worst-case"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
80	Gideon Avigad, Jürgen Branke	Embedded evolutionary multi-objective optimization for worst case robustness.	GECCO	2008	DBLP DOI BibTeX RDF	robustness, multi-objective, worst-case
80	Sujit Dey, Surendra Bommu	Performance analysis of a system of communicating processes.	ICCAD	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.	Real Time Syst.	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.	ISPD	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.	GECCO	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.	ACM Trans. Embed. Comput. Syst.	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.	STOC	2007	DBLP DOI BibTeX RDF	algebraic number theory, worst-case to average-case reductions, lattices
61	Jana Cerbáková	Worst-case VaR and CVaR.	OR	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.	SAC	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.	ISCIS	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.	STACS	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.	ISSRE	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.	CCC	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.	RTSS	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.	FPGA	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.	Telecommun. Syst.	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.	EMSOFT	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.	Queueing Syst. Theory Appl.	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.	LCTES	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.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	C. Seshadhri 0001	Self-Improving Algorithms.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Sanjoy Dasgupta, Samory Kpotufe	Nearest Neighbor Classification and Search.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Tim Roughgarden	Resource Augmentation.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Uriel Feige	Introduction to Semirandom Models.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Aravindan Vijayaraghavan	Efficient Tensor Decompositions.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Ankur Moitra	Semirandom Stochastic Block Models.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Inbal Talgam-Cohen	Prior-Independent Auctions.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan	When Simple Hash Functions Suffice.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Tim Roughgarden, C. Seshadhri 0001	Distribution-Free Models of Social Networks.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Eric Price 0001	Sparse Recovery.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Avrim Blum	Approximation Stability and Proxy Objectives.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Tengyu Ma 0001	Why Do Local Methods Solve Nonconvex Problems?	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Maria-Florina Balcan, Nika Haghtalab	Noise in Classification.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Daniel Dadush, Sophie Huiberts	Smoothed Analysis of the Simplex Method.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Ilias Diakonikolas, Daniel M. Kane	Robust High-Dimensional Statistics.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Michael Mitzenmacher, Sergei Vassilvitskii	Algorithms with Predictions.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Bodo Manthey	Smoothed Analysis of Local Search.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Anupam Gupta 0001, Sahil Singla 0001	Random-Order Models.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Konstantin Makarychev, Yury Makarychev	Perturbation Resilience.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Tim Roughgarden	Distributional Analysis.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Jérémy Barbay	From Adaptive Analysis to Instance Optimality.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Gregory Valiant, Paul Valiant	Instance Optimal Distribution Testing and Learning.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Maria-Florina Balcan	Data-Driven Algorithm Design.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Heiko Röglin	Smoothed Analysis of Pareto Curves in Multiobjective Optimization.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Vijay Ganesh, Moshe Y. Vardi	On the Unreasonable Effectiveness of SAT Solvers.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Rong Ge 0001, Ankur Moitra	Topic Models and Nonnegative Matrix Factorization.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Moritz Hardt	Generalization in Overparameterized Models.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Anna R. Karlin, Elias Koutsoupias	Beyond Competitive Analysis.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
53	Tim Roughgarden	Introduction.	Beyond the Worst-Case Analysis of Algorithms	2020	DBLP DOI BibTeX RDF
52	Jikai Li, Chunming Qiao, Jinhui Xu 0001, Dahai Xu	Maximizing throughput for optical burst switching networks.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	scheduling, OBS, worst case
51	Adriano Valenzano, Paolo Montuschi, Luigi Ciminiera	Some Properties of Timed Token Medium Access Protocols.	IEEE Trans. Software Eng.	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.	Theory Comput. Syst.	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.	RTCSA	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.	RTSS	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.	DAC	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.	JTRES	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.	ICN/ICONS/MCL	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.	RTCSA	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.	LCN	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.	IEEE Real Time Technology and Applications Symposium	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.	IEEE Trans. Software Eng.	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.	CODES	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.	FOCS	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.	RTSS	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.	Formal Aspects Comput.	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.	SPAA	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.	ESA	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.	DAC	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.	IEEE Trans. Very Large Scale Integr. Syst.	2003	DBLP DOI BibTeX RDF
45	Abhijit Dharchoudhury, Sung-Mo Kang	Worst-case analysis and optimization of VLSI circuit performances.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	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.	ICNP	2005	DBLP DOI BibTeX RDF
45	Kelvin D. Nilsen, Hong Gao	The real-time behavior of dynamic memory management in C++.	IEEE Real Time Technology and Applications Symposium	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.	ISCA	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.	SLIP	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.	CASES	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.	Oper. Res.	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.	IEEE Trans. Parallel Distributed Syst.	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.	OTM Workshops	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.	APPROX-RANDOM	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.	RTCSA	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.	COCOA	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.	PPSN	2008	DBLP DOI BibTeX RDF
41	Steven Martin 0001, Pascale Minet	Holistic and Trajectory Approaches for Distributed Non-preemptive FP/DP* Scheduling.	ICN (1)	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.	IEEE Trans. Signal Process.	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.	ECRTS	2005	DBLP DOI BibTeX RDF
40	Taehyoun Kim, Naehyuck Chang, Heonshik Shin	Bounding Worst Case Garbage Collection Time for Embedded Real-Time Systems.	IEEE Real Time Technology and Applications Symposium	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.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	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.	ISORC	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).	FOCS	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	FOCS	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	FOCS	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.	ICCSA (3)	2007	DBLP DOI BibTeX RDF
40	Rohit Sunkam Ramanujam, Bill Lin 0001	Near-optimal oblivious routing on three-dimensional mesh networks.	ICCD	2008	DBLP DOI BibTeX RDF
39	Lili Tan	The worst-case execution time tool challenge 2006.	Int. J. Softw. Tools Technol. Transf.	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.	ACM Trans. Embed. Comput. Syst.	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.	ISORC	2008	DBLP DOI BibTeX RDF	WCET worst-case execution time prediction
39	Raimund Kirner, Peter P. Puschner	Obstacles in Worst-Case Execution Time Analysis.	ISORC	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.	CASES	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.	VLSI Design	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.	DAC	2004	DBLP DOI BibTeX RDF	program slicing assembler programs, real-time systems, abstraction, worst case execution time, symbolic simulation