Search results for "NP-hard"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
20	Jia Xu, David Lorge Parnas	Correction to "On Satisfying Timing Constraints in Hard-Real-Time Systems''.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	scheduling, real-time systems, timing constraints, hard-real-time systems
20	Karsten Schwan, Hongyi Zhou	Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads.	IEEE Trans. Software Eng.	1992	DBLP DOI BibTeX RDF	hard real-time tasks, real-time threads, real-time multiprocessor operating system kernel, scheduling, real-time systems, computational complexity, timing constraints, dynamic scheduling, network operating systems, precedence constraints, preemptive scheduling, worst-case complexity
20	Russell Impagliazzo, Leonid A. Levin	No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random	FOCS	1990	DBLP DOI BibTeX RDF	distributed NP problems, hard NP, DNP problem, P-time computable distributions, NP completeness, probability distributions, average-case complexity
20	John A. Stankovic	Decentralized Decision Making for Task Reallocation in a Hard Real-Time System.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	decentralised decision-making, task reallocation, simulation, scheduling, distributed system, real-time systems, performance analysis, distributed processing, deadlines, hard real-time system
20	Joseph C. Culberson, Robert A. Reckhow	Covering Polygons Is Hard (Preliminary Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	minimum cover problems, arbitrary polygon, orthogonal polygon, NP-hard, boundary, covering problems, convex polygons, rectangles
20	Thomas E. Fuja, Chris Heegard	Row/Column Replacement for the Control of Hard Defects in Semiconductor RAM's.	IEEE Trans. Computers	1986	DBLP DOI BibTeX RDF	hard defects, RAM's, row/column replacement, reliability, redundancy, Error-control coding, yield improvement
20	Franz-Josef Brandenburg, Mao-cheng Cai	Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.	FAW	2009	DBLP DOI BibTeX RDF	extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard
20	Mu Zhang 0004, Johnny Wong, Wallapak Tavanapong, Jung-Hwan Oh 0001, Piet C. de Groen	Deadline-constrained media uploading systems.	Multim. Tools Appl.	2008	DBLP DOI BibTeX RDF	File upload, Emergency control for storage overflow, Scheduling algorithms, Hard real-time systems
20	He Jiang 0001, Xianchao Zhang 0001, Guoliang Chen 0001, Mingchu Li	Backbone analysis and algorithm design for the quadratic assignment problem.	Sci. China Ser. F Inf. Sci.	2008	DBLP DOI BibTeX RDF	backbone analysis, biased instance, NP-hard, meta-heuristic, quadratic assignment problem
20	Zoe Lin Jiang, Lucas Chi Kwong Hui, Siu-Ming Yiu	Improving Disk Sector Integrity Using K-Dimension Hashing. (PDF / PS)	IFIP Int. Conf. Digital Forensics	2008	DBLP DOI BibTeX RDF	Evidence integrity, k-dimension hashing, hard disks, hash values
20	R. Kapoor, S. R. Arora	Complexity of a particular class of single and multiple ratio quadratic 0-1 fractional programming problems.	Oper. Res.	2007	DBLP DOI BibTeX RDF	0-1 Quadratic Fractional Programming, Global Verification, 90C32, Complexity, Local Search, NP-hard, 90C10, 90C60, 90C20
20	Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia	Linear FPT reductions and computational lower bounds.	STOC	2004	DBLP DOI BibTeX RDF	lower bound, complexity theory, NP-hard problems
20	Erik Yu-Shing Hu, Guillem Bernat, Andy J. Wellings	A Static Timing Analysis Environment Using Java Architecture for Safety Critical Real-Time Systems.	WORDS	2002	DBLP DOI BibTeX RDF	Portable WCET Analysis, Java, Hard Real-Time Systems, Real-Time Java, Worst-Case Execution Time Analysis
20	Kwok-Wa Lam, Sheung-lun Hung	A pre-emptive transaction scheduling protocol for controlling priority inversion.	RTCSA	1996	DBLP DOI BibTeX RDF	pre-emptive transaction scheduling protocol, hard real-time database systems, priority inversion problem, system schedulability, blocking delay, transaction preemptability, worst-case scheduling conditions, semantics, data integrity, data consistency, priority inversion, concurrency control protocols, real-time transactions, priority ceiling protocols
20	Ira Pramanick, Jon G. Kuhl	An Inherently Parallel Method for Heuristic Problem-Solving: Part I-General Framework.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF	heuristic problem solving, dynamic interaction, locally applied heuristics, NP-hard problems, inherently parallel
19	David Detlefs	A Hard Look at Hard Real-Time Garbage Collection.	ISORC	2004	DBLP DOI BibTeX RDF
19	Brian B. Laird	Do Your Hard-Spheres Have Tails? A Molecular Dynamics Integration Algorithm for Systems with Mixed Hard-Core/Continuous Potentials.	International Conference on Computational Science (2)	2001	DBLP DOI BibTeX RDF
19	Karl Bringmann, Tobias Friedrich 0001	Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice.	EMO	2009	DBLP DOI BibTeX RDF
19	Vincent Conitzer, Tuomas Sandholm, Jérôme Lang	When are elections with few candidates hard to manipulate?.	J. ACM	2007	DBLP DOI BibTeX RDF	hardness of manipulation, voting, Computational social choice
19	Pin Zhou, Radu Teodorescu, Yuanyuan Zhou	HARD: Hardware-Assisted Lockset-based Race Detection.	HPCA	2007	DBLP DOI BibTeX RDF
19	Hasan Guclu, Murat Yuksel	Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks.	ICDCS	2007	DBLP DOI BibTeX RDF
19	Abhishek Pillai, Wei Zhang 0002, Dimitrios Kagaris	Detecting VLIW Hard Errors Cost-Effectively through a Software-Based Approach.	AINA Workshops (1)	2007	DBLP DOI BibTeX RDF
19	Hai Jin 0001, Minghu Zhang, Pengliu Tan	Dual-Level Traffic Smoothing Technique over Switched Ethernet for Hard Real-Time Communication.	ISCIS	2006	DBLP DOI BibTeX RDF
19	Vladimir G. Deineko, Alexandre Tiskin	One-Sided Monge TSP Is NP-Hard.	ICCSA (3)	2006	DBLP DOI BibTeX RDF
19	Miki Namatame, Muneo Kitajima	Improving web usability for the hard-of-hearing.	ETRA	2006	DBLP DOI BibTeX RDF
19	Venkatesan Guruswami, Alexander Vardy	Maximum-likelihood decoding of Reed-Solomon codes is NP-hard.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
19	Venkatesan Guruswami, Alexander Vardy	Maximum-likelihood decoding of Reed-Solomon codes is NP-hard.	SODA	2005	DBLP BibTeX RDF
19	Sven Burmester, Holger Giese, Wilhelm Schäfer	Model-Driven Architecture for Hard Real-Time Systems: From Platform Independent Models to Code.	ECMDA-FA	2005	DBLP DOI BibTeX RDF
19	Irith Pomeranz, Sudhakar M. Reddy, Sandip Kundu	On the characterization and efficient computation of hard-to-detect bridging faults.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2004	DBLP DOI BibTeX RDF
19	Luis Alejandro Cortés, Petru Eles, Zebo Peng	Static Scheduling of Monoprocessor Real-Time Systems composed of Hard and Soft Tasks.	DELTA	2004	DBLP DOI BibTeX RDF
19	Basheer Al-Duwairi, Govindarasu Manimaran	Combined Scheduling of Hard and Soft Real-Time Tasks in Multiprocessor Systems.	HiPC	2003	DBLP DOI BibTeX RDF
19	Adi Akavia, Shafi Goldwasser, Shmuel Safra	Proving Hard-Core Predicates Using List Decoding.	FOCS	2003	DBLP DOI BibTeX RDF
19	Vincent Conitzer, Jérôme Lang, Tuomas Sandholm	How many candidates are needed to make elections hard to manipulate?	TARK	2003	DBLP DOI BibTeX RDF
19	Peter P. Puschner	Hard Real-Time Programming is Different.	IPDPS	2003	DBLP DOI BibTeX RDF
19	Peter P. Puschner	Algorithms for Dependable Hard Real-Time Systems.	WORDS	2003	DBLP DOI BibTeX RDF
19	Moni Naor	Moderately Hard Functions: From Complexity to Spam Fighting.	FSTTCS	2003	DBLP DOI BibTeX RDF
19	Julia Chuzhoy, Joseph Naor	Covering Problems with Hard Capacities.	FOCS	2002	DBLP DOI BibTeX RDF
19	Guillem Bernat, Ricardo Cayssials	Guaranteed On-Line Weakly-Hard Real-Time Systems.	RTSS	2001	DBLP DOI BibTeX RDF
19	Pascal Chevochot, Antoine Colin, David Decotigny, Isabelle Puaut	Are COTS Suitable for Building Distributed Fault-Tolerant Hard Real-Time Systems?.	IPDPS Workshops	2000	DBLP DOI BibTeX RDF
19	Jae-dong Lee	A Hard Real-Time Tasks Model for the VBR Video Server.	ITCC	2000	DBLP DOI BibTeX RDF
19	Adam R. Klivans, Rocco A. Servedio	Boosting and Hard-Core Sets.	FOCS	1999	DBLP DOI BibTeX RDF
19	Juraj Hromkovic	Stability of Approximation Algorithms for Hard Optimization Problems.	SOFSEM	1999	DBLP DOI BibTeX RDF
19	Lance Fortnow, Aduri Pavan, Alan L. Selman	Distributionally-Hard Languages.	COCOON	1999	DBLP DOI BibTeX RDF
19	Jack H. Lutz, Elvira Mayordomo	Measure, Stochasticity, and the Density of Hard Languages.	STACS	1993	DBLP DOI BibTeX RDF
19	Evgeny V. Shchepin, Nodari Vakhania	On the geometry, preemptions and complexity of multiprocessor and shop scheduling.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Shop scheduling, Algorithm, Time complexity, Multiprocessor scheduling, Preemption
19	Josep Argelich, Felip Manyà	Partial Max-SAT Solvers with Clause Learning.	SAT	2007	DBLP DOI BibTeX RDF
19	Paolo Liberatore	Complexity results on DPLL and resolution.	ACM Trans. Comput. Log.	2006	DBLP DOI BibTeX RDF	Davis-Putnam, NP-completeness, propositional satisfiability
19	Harry Buhrman, Montserrat Hermo	On the Sparse Set Conjecture for Sets with Low Denisty.	STACS	1995	DBLP DOI BibTeX RDF
17	Marc Schlickling, Markus Pister 0002	Semi-automatic derivation of timing models for WCET analysis.	LCTES	2010	DBLP DOI BibTeX RDF	vhdl, worst-case execution time, hard real-time
17	Shu Liu, Xu Cheng 0001, Xuetao Guan, Dong Tong 0001	Energy efficient management scheme for heterogeneous secondary storage system in mobile computers.	SAC	2010	DBLP DOI BibTeX RDF	heterogeneous secondary storage, flash memory, energy saving, hard disk
17	Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov	On Two Techniques of Combining Branching and Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms
17	Srivatsan Narayanan, Ananth Raghunathan, Ramarathnam Venkatesan	Obfuscating straight line arithmetic programs.	Digital Rights Management Workshop	2009	DBLP DOI BibTeX RDF	hard-to-factor polynomials, straight line arithmetic programs, drm, obfuscation, software protection, secure hardware
17	David Fick, Andrew DeOrio, Jin Hu, Valeria Bertacco, David T. Blaauw, Dennis Sylvester	Vicis: a reliable network for unreliable silicon.	DAC	2009	DBLP DOI BibTeX RDF	hard faults, fault tolerance, built-in-self-test, Network-on-Chip, reconfiguration, torus, N-modular redundancy
17	Joseph Y.-T. Leung, Hairong Zhao	Scheduling problems in master-slave model.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Master slave model, Approximation algorithms, NP-hard, Makespan, Total completion time
17	Xin Chen 0037, Lan Liu 0001, Zheng Liu, Tao Jiang 0001	On the minimum common integer partition problem.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	approximation algorithm, combinatorial optimization, NP-hard, computational biology, Subset sum, integer partition
17	Ning Chen, Atri Rudra	Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.	Algorithmica	2008	DBLP DOI BibTeX RDF	Walrasian equilibrium, Single-minded auction, Approximation, NP-hard, Combinatorial auction
17	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
17	Danyu Bai, Lixin Tang, Meng Su	A New Machine Scheduling Problem with Temperature Loss.	WKDD	2008	DBLP DOI BibTeX RDF	Temperature Drop Curve, Total Temperature Drop Loss, Scheduling, NP-hard
17	Richard Kheir, Thomas P. Way	Inclusion of deaf students in computer science classes using real-time speech transcription.	ITiCSE	2007	DBLP DOI BibTeX RDF	deaf students, hard of hearing students, accessibility, speech recognition, computer science education, assistive technology, inclusion
17	Miki Namatame, Fusako Kusunoki	Learning onomatopoeic expressions by animation.	Advances in Computer Entertainment Technology	2007	DBLP DOI BibTeX RDF	hard-of-hearing, onomatopoeic, visualization, animation
17	Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh	Filtering Algorithms for the NValueConstraint.	Constraints An Int. J.	2006	DBLP DOI BibTeX RDF	NValue constraint, AtleastNValue, AtMostNValue, NP-hard, pruning, global constraints, linear relaxation
17	Binwu Zhang, Jianzhong Zhang 0001, Liqun Qi 0001	The shortest path improvement problems under Hamming distance.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	NP-hard, Hamming distance, Shortest path problem
17	Mohammad Azam Rana, Halim Setan, Zulkepli Majid, Albert K. Chong	Computer Assisted Surgical Planner for Craniofacial Reconstruction - Imaging Techniques.	GMAI	2006	DBLP DOI BibTeX RDF	surgical planner, hard tissue, cutting, CAS, soft tissue
17	Guido Pennella, Christian Di Biagio, Alessandro Colicchia, Gianfranco Pesce, Giovanni Cantone	Monitoring Distributed Systems for Safety Critical Software: A Goal-Driven Approach and Prototype-Tool.	ISPA Workshops	2006	DBLP DOI BibTeX RDF	Performance-measurement Tools, Software engineering, Hard Real-time Systems, Distributed and parallel systems
17	Linda Dailey Paulson	News Briefs.	Computer	2005	DBLP DOI BibTeX RDF	hard-drive systems, FPGAs, reconfigurable computing, flash memory, Wi-Fi, supercomputers, location services, power-aware computing
17	Qizhi Fang, Hye Kyung Kim, Dae Sik Lee	Total Dominating Set Games.	WINE	2005	DBLP DOI BibTeX RDF	Rigid total dominating set game, relaxed total dominating set game, core, balancedness, hard
17	Jesús Fabián López Pérez	A Meta-heuristic Applied for a Topologic Pickup and Delivery Problem with Time Windows Constraints.	International Conference on Computational Science (3)	2005	DBLP DOI BibTeX RDF	Genetic Algorithms, NP-Hard, Logistics, Time Windows
17	Masayuki Nakamura, Hiroki Nomiya, Kuniaki Uehara	Improvement of Boosting Algorithm by Modifying the Weighting Rule.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	hard example, weighting rule, errorbound, NadaBoost, AdaBoost
17	Esther Ezra, Micha Sharir	Counting and representing intersections among triangles in three dimensions.	SCG	2004	DBLP DOI BibTeX RDF	3SUM-hard problems, counting intersections, curve-sensitive cuttings, triangles in three dimensions, arrangements
17	Sanjoy K. Baruah, Shelby H. Funk, Joël Goossens	Robustness Results Concerning EDF Scheduling upon Uniform Multiprocessors.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Uniform multiprocessors, robustness, earliest deadline first, hard-real-time systems, resource augmentation
17	Nikolay P. Varnovsky, Vladimir A. Zakharov	On the Possibility of Provably Secure Obfuscating Programs.	Ershov Memorial Conference	2003	DBLP DOI BibTeX RDF	hard-core predicate, security, program transformation, mutual information, obfuscation, one-way function
17	Jan Poland, Kosmas Knödler, Alexander Mitterer, Thomas Fleischhauer, Frank Zuber-Goos, Andreas Zell	Evolutionary Search for Smooth Maps in Motor Control Unit Calibration.	SAGA	2001	DBLP DOI BibTeX RDF	Control Unit Calibration, Variable Alphabet Coding, Hybrid GA, Smooth Maps, Genetic Algorithm, Combinatorial Optimization, NP-hard
17	Daeyoung Kim 0001, Yann-Hang Lee	DC2 scheduling for aperiodic tasks in strongly partitioned real-time systems.	RTCSA	2000	DBLP DOI BibTeX RDF	DC/sup 2/ scheduling, aperiodic task scheduling, strongly partitioned real time systems, SP-RTS, integrated real time applications, two-level hierarchical scheduling mechanism, multiple partitions, multiple periodic tasks, fixed priority algorithm, Distance Constraint guaranteed Dynamic Cyclic scheduler, distance-constrained cyclic schedule, distance constraint characteristics, partition cyclic schedule, slack time calculation, dynamic operations, hard aperiodic tasks, DC/sup 2/, soft aperiodic tasks, acceptance rate, scheduling, real-time systems, computational complexity, online scheduling, cyclic scheduling, spatial partitioning, partition scheduling, dynamic applications
17	Luca Abeni, Giorgio C. Buttazzo	Support for dynamic QoS in the HARTIK kernel.	RTCSA	2000	DBLP DOI BibTeX RDF	dynamic QoS support, HARTIK, hard real-time kernel, control applications, soft real-time applications, service mechanism, temporal protection abstraction, service quality manager, reserved resource adaptation, task requirements, quality of service, real-time systems, stability, multimedia applications, multimedia computing, operating system kernels, computerised control, robot applications
17	LihChyun Shu, Michal Young	Chopping and versioning real-time transactions to avoid remote blocking.	RTCSA	2000	DBLP DOI BibTeX RDF	real time transaction versioning, remote blocking, versioning protocols, chopping analysis, pure locking protocols, 1-version serializability, design time information, simple data structures, small bounded overheads, worst case access times, scheduling, real-time systems, protocols, concurrency control, multiprocessors, multiprocessing systems, transaction processing, configuration management, schedulability analysis, hard real time systems, critical sections, locking protocols, database concurrency control
17	Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo Han, Ju-Sung Kang, Choonsik Park	New Public-Key Cryptosystem Using Braid Groups.	CRYPTO	2000	DBLP DOI BibTeX RDF	hard problem, non-commutative group, public key cryptosystem, public key infrastructure, key exchange, one-way function, braid group, conjugacy problem
17	Jianzhong Zhang 0001, Xiaoguang Yang, Mao-cheng Cai	Reverse Center Location Problem.	ISAAC	1999	DBLP DOI BibTeX RDF	networks and graphs, maximum cost circulation. ams subject classification. 68q25, np-hard, 90c27, relaxation, satisfiability problem
17	Steffen Reith, Klaus W. Wagner	On Boolean Lowness and Boolean Highness.	COCOON	1998	DBLP DOI BibTeX RDF	lowness, highness, boolean lowness, boolean highness, boolean hierarchy, hard/easy, Computational complexity, advice, polynomial-time hierarchy, collapse
17	James H. Anderson, Srikanth Ramamurthy, Kevin Jeffay	Real-Time Computing with Lock-Free Shared Objects.	ACM Trans. Comput. Syst.	1997	DBLP DOI BibTeX RDF	scheduling, synchronization, earliest deadline first, hard real time, wait free, lock free, critical sections, rate monotonic, deadline monotonic
17	Ching-Chuan Chiang, Mario Gerla, Lixia Zhang 0001	Shared Tree Wireless Network Multicast.	ICCCN	1997	DBLP DOI BibTeX RDF	Hard state, Soft Stat, Clustering, Routing, Multicast, Multihop Wireless Networks
17	Peter J. Stuckey, Vincent W. L. Tam	Extending EGENET with Lazy Constraint Consistency.	ICTAI	1997	DBLP DOI BibTeX RDF	extended EGENET, lazy constraint consistency, neural network simulator, min-conflict heuristic, hard graph-colouring problems, complete search methods, stochastic search methods, convergence behaviour, scheduling, planning (artificial intelligence), planning, constraint satisfaction problems, bin-packing, arc consistency, search behaviour
17	Ismael Ripoll, Ana García-Fornes, Alfons Crespo	Optimal aperiodic scheduling for dynamic-priority systems.	RTCSA	1996	DBLP DOI BibTeX RDF	optimal aperiodic scheduling, dynamic-priority systems, soft real-time constraints, hard real-time constraints, on-line aperiodic admission algorithm, optimal dynamic priority preemptive scheduler, shortest response time, soft aperiodic tasks, dynamic priority schedulers, firm deadline aperiodic tasks, real-time systems, fixed priority schedulers
17	Jinho Kim, Kang G. Shin	On data logging in real-time process control systems.	RTCSA	1996	DBLP DOI BibTeX RDF	data logging, real-time process control systems, hard real-time data logging tasks, integrated scheduling scheme, soft real-time monitoring tasks, timeliness guarantees, real-time disk scheduling algorithm, UNIX, process control, general-purpose operating systems
17	Steven G. Woods, Qiang Yang 0001	The Program Understanding Problem: Analysis and a Heuristic Approach.	ICSE	1996	DBLP BibTeX RDF	complex source code, formal complexity results, heuristic solutions, problem solving model, program understanding problem, computational complexity, reverse engineering, conceptual models, NP hard, CSPs, search problems, constraint satisfaction problems, constraint propagation, search algorithms, constraint handling, heuristic approach
17	Stefan Radtke, Jens Bargfrede, Walter Anheier	Distributed automatic test pattern generation with a parallel FAN algorithm.	ICCD	1995	DBLP DOI BibTeX RDF	distributed automatic test pattern generation, parallel FAN algorithm, backtracking mechanism, heterogeneous cluster of workstations, test vector compaction, genetic algorithms, genetic algorithm, parallel algorithms, computational complexity, logic testing, digital circuits, digital circuits, NP hard problem, sequential algorithms
17	Yung-Sheng Chen	Computer processing on the identification of a Chinese seal image.	ICDAR	1995	DBLP DOI BibTeX RDF	Chinese seal image identification, hard-matching, human visual inspection, optical character recognition, image recognition
17	Steve Vestal	Fixed-Priority Sensitivity Analysis for Linear Compute Time Models.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	fixed-priority sensitivity analysis, linear computation time models, scheduling discipline, hard real-time periodic tasks, task scheduling feasibility, real-time verification, real-time benchmarking, real-time architectures, scheduling, real-time systems, computational complexity, formal verification, software components, real-time scheduling, sensitivity analysis, modules, schedulability analysis, software development process, rate monotonic scheduling, task decomposition, fixed-priority preemptive scheduling, uniprocessor
17	M. Bozyigit, M. Melhi	Dynamic Load Balancing in Distributed Real-Time Systems (Abstract).	ACM Conference on Computer Science	1990	DBLP DOI BibTeX RDF	distributed realtime system, graph theoretic, linear and nonlinear programming, incremental heuristic refinement algorithm, Load balancing, NP-hard
16	Thomas Terkildsen, Lene Engelst, Mathias Clasen	Work Hard, Scare Hard? An Investigation of How Mental Workload Impacts Jump Scare Intensity.	Proc. ACM Hum. Comput. Interact.	2023	DBLP DOI BibTeX RDF
16	Arne F. Nix, Max F. Burg, Fabian H. Sinz	HARD: Hard Augmentations for Robust Distillation.	CoRR	2023	DBLP DOI BibTeX RDF
16	Bo Xu 0023, Shouang Wei, Luyi Cheng, Shizhou Huang, Hui Song, Ming Du, Hongya Wang	HSimCSE: Improving Contrastive Learning of Unsupervised Sentence Representation with Adversarial Hard Positives and Dual Hard Negatives.	IJCNN	2023	DBLP DOI BibTeX RDF
16	Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki	Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes.	SCN	2022	DBLP DOI BibTeX RDF
16	Federico Bonetti, Elisa Leonardelli, Daniela Trotta, Raffaele Guarasci, Sara Tonelli	Work Hard, Play Hard: Collecting Acceptability Annotations through a 3D Game.	LREC	2022	DBLP BibTeX RDF
16	Bryce Goodman	Hard Choices and Hard Limits for Artificial Intelligence.	CoRR	2021	DBLP BibTeX RDF
16	Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki	Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
16	Damianos Galanopoulos, Vasileios Mezaris	Hard-Negatives or Non-Negatives? A Hard-Negative Selection Strategy for Cross-Modal Retrieval Using the Improved Marginal Ranking Loss.	ICCVW	2021	DBLP DOI BibTeX RDF
16	Zhun Fan, Zhi Yang 0007, Yajuan Tang, Wenji Li, Biao Xu, Zhaojun Wang, Fuzan Sun, Zhoubin Long, Guijie Zhu	An Improved Epsilon Method with M2M for Solving Imbalanced CMOPs with Simultaneous Convergence-Hard and Diversity-Hard Constraints.	EMO	2021	DBLP DOI BibTeX RDF
16	Bryce Goodman	Hard Choices and Hard Limits in Artificial Intelligence.	AIES	2021	DBLP DOI BibTeX RDF
16	Michael Hoffmann 0001, Jayson Lynch, Andrew Winslow	Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.	J. Inf. Process.	2020	DBLP DOI BibTeX RDF
16	Alexisz Tamás Gaál	Long-range orientational order of random near-lattice hard sphere and hard disk processes.	J. Appl. Probab.	2020	DBLP DOI BibTeX RDF