Search results for "NP-hard"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
28	Bert Willaert, Emmanuel B. Vander Poorten, Dominiek Reynaerts, Hendrik Van Brussel	A Pragmatic Method for Stable Stiffness Reflection in Telesurgery.	EuroHaptics	2008	DBLP DOI BibTeX RDF	Telesurgery, Hard Contact, Stability, Teleoperation
27	Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma	If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances.	Comput. Complex.	2007	DBLP DOI BibTeX RDF	68Q17, 68Q15, 94A60, Subject classification. 68Q10
27	Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma	If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances.	CCC	2005	DBLP DOI BibTeX RDF
27	Miki Namatame, Tomoyuki Nishioka, Muneo Kitajima	Designing a Web Page Considering the Interaction Characteristics of the Hard-of-Hearing.	ICCHP	2006	DBLP DOI BibTeX RDF
27	Jin-yi Cai, Ashish V. Naik, D. Sivakumar	On the Existence of Hard Sparse Sets under Weak Reductions.	STACS	1996	DBLP DOI BibTeX RDF
25	Alireza Ejlali, Bashir M. Al-Hashimi, Petru Eles	A standby-sparing technique with low energy-overhead for fault-tolerant hard real-time systems.	CODES+ISSS	2009	DBLP DOI BibTeX RDF	reliability, energy minimization, hard real-time systems
25	Daliang Zhang, Shudong Shi	Hard Real Time Task Oriented Power Saving Scheduling Algorithm Based on DVS.	ISICA	2009	DBLP DOI BibTeX RDF	power saving scheduling, task division, hard real time
25	Krishna Kant Chintalapudi, Lakshmi Venkatraman	On the Design of MAC Protocols for Low-Latency Hard Real-Time Discrete Control Applications over 802.15.4 Hardware.	IPSN	2008	DBLP DOI BibTeX RDF	Discrete Control, Low-power, MAC, Hard Real-time
25	Eduardo Tavares, Paulo Romero Martins Maciel, Bruno Silva 0001, Meuse N. Oliveira Jr.	A time petri net-based approach for hard real-time systems scheduling considering dynamic voltage scaling, overheads, precedence and exclusion relations.	SBCCI	2007	DBLP DOI BibTeX RDF	petri nets, dynamic voltage scaling, formal models, hard real-time systems
25	Jaw-Wei Chi, Chia-Lin Yang, Yi-Jung Chen, Jian-Jia Chen	Cache leakage control mechanism for hard real-time systems.	CASES	2007	DBLP DOI BibTeX RDF	cache leakage control policy, hard real-time system
25	Michael G. Bailey	A web systems laboratory using portable hard drives.	SIGITE Conference	2007	DBLP DOI BibTeX RDF	portable hard drive, laboratory, web systems
25	Carmel Domshlak, Steven D. Prestwich, Francesca Rossi 0001, Kristen Brent Venable, Toby Walsh	Hard and soft constraints for reasoning about qualitative conditional preferences.	J. Heuristics	2006	DBLP DOI BibTeX RDF	Hard and Soft Constraints, CP-nets, Preferences
25	Fred A. Bower, Derek Hower, Mahmut Yilmaz, Daniel J. Sorin, Sule Ozev	Applying architectural vulnerability Analysis to hard faults in the microprocessor.	SIGMETRICS/Performance	2006	DBLP DOI BibTeX RDF	hard-fault tolerance, reliability, computer architecture
25	Davide Falessi, Guido Pennella, Giovanni Cantone	Experiences, Strategies and Challenges in Adapting PVM to VxWorks™ Hard Real-Time Operating System, for Safety-Critical Software.	PVM/MPI	2005	DBLP DOI BibTeX RDF	Open Source Software (OSS), Safety-Critical Software (SCS), Embedded Hard Real-Time (HRT) Distributed Systems, Experimental Software Engineering (ESE), Parallel Virtual Machine (PVM)
25	Yuri M. Suhov, Utkir A. Rozikov	A Hard-Core Model on a Cayley Tree: An Example of a Loss Network.	Queueing Syst. Theory Appl.	2004	DBLP DOI BibTeX RDF	Cayley trees, nearest-neighbor exclusion, hard core, Gibbs measures, translation invariant measures, periodic measures, splitting measures, extreme Gibbs measures, loss networks
25	Christos Kloukinas	Data-Mining Synthesised Schedulers for Hard Real-Time Systems.	ASE	2004	DBLP DOI BibTeX RDF	scheduler synthesis, data-mining, Software engineering, schedulability analysis, hard real-time systems, decision-tree induction
25	Marty Humphrey, John A. Stankovic	Predictable Threads for Dynamic, Hard Real-Time Environments.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	threads, Hard real-time systems, multiprocessing, real-time operating systems
25	Stefan M. Petters, Georg Färber	Making Worst Case Execution Time Analysis for Hard Real-Time Tasks on State of the Art Processors Feasible.	RTCSA	1999	DBLP DOI BibTeX RDF	WCET analyses, caches, hard real-time, control flow analysis, automated measurement
25	Giorgio C. Buttazzo, Fabrizio Sensini	Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments.	ICECCS	1997	DBLP DOI BibTeX RDF	optimal deadline assignment, soft aperiodic tasks scheduling, hard real-time environments, earliest deadline first algorithm, full processor utilization, optimal aperiodic responsiveness, simulations, performance, computational complexity, complexity, application requirements, implementation complexity
25	Tai-Yi Huang, Jane W.-S. Liu, Jen-Yao Chung	Allowing cycle-stealing direct memory access I/O concurrent with hard-real-time programs.	ICPADS	1996	DBLP DOI BibTeX RDF	cycle-stealing direct memory access, I/O concurrent, hard-real-time programs, bus cycles, straight-line sequence, cycle-stealing operations, real-time systems, fault tolerant computing, worst-case execution time, schedulability analysis, file organisation
25	Miodrag Potkonjak, Wayne H. Wolf	Cost optimization in ASIC implementation of periodic hard-real time systems using behavioral synthesis techniques.	ICCAD	1995	DBLP DOI BibTeX RDF	allocation algorithms, behavioral synthesis techniques, datapath synthesis criteria, multiple computational tasks, multiple-task examples, periodic hard-real time systems, real-time systems, high level synthesis, logic design, application specific integrated circuits, circuit CAD, circuit optimisation, cost optimization, rate-monotonic scheduling, task sharing, synthesis algorithm, ASIC implementation
25	Ismael Ripoll, Alfons Crespo, Ana García-Fornes	An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems.	IEEE Trans. Software Eng.	1997	DBLP DOI BibTeX RDF	Dynamic scheduling theory, slack scheduling, soft aperiodic tasks, dynamic, hard real-time, feasibility analysis
25	Yunsheng Xiong, Peng Zhang, Yong Dou, Kele Xu, Xin Niu	Focus on Hard Categories and Hard Examples: Remote Sensing Image Scene Classification via Expert Model and Hard Example Mining.	IEEE Geosci. Remote. Sens. Lett.	2022	DBLP DOI BibTeX RDF
25	S. Shankar, R. Siddarth, R. Nithyaprakash, M. S. Uddin	Wear prediction of hard carbon coated hard-on-hard hip implants using finite element method.	Int. J. Comput. Aided Eng. Technol.	2018	DBLP DOI BibTeX RDF
25	Chunming Shi 0003, Adrian David Cheok	Performance comparison of fused soft control/hard observer type controller with hard control/hard observer type controller for switched reluctance motors.	IEEE Trans. Syst. Man Cybern. Part C	2002	DBLP DOI BibTeX RDF
25	Ethan Schuchman, T. N. Vijaykumar	BlackJack: Hard Error Detection with Redundant Threads on SMT.	DSN	2007	DBLP DOI BibTeX RDF
25	Kiduk Yang, Ning Yu 0005, Hui Zhang 0069, Shahrier Akram, Ivan Record	WIDIT: Integrated Approach to HARD Topic Search.	AIRS	2006	DBLP DOI BibTeX RDF
25	Fred A. Bower, Daniel J. Sorin, Sule Ozev	A Mechanism for Online Diagnosis of Hard Faults in Microprocessors.	MICRO	2005	DBLP DOI BibTeX RDF
25	Alimujiang Yiming, Toshio Eisaka	Support Industrial Hard Real-Time Traffic with Switched Ethernet.	ICESS	2005	DBLP DOI BibTeX RDF
25	John Thornton 0001, Stuart Bain, Abdul Sattar 0001, Duc Nghia Pham	A Two Level Local Search for MAX-SAT Problems with Hard and Soft Constraints.	Australian Joint Conference on Artificial Intelligence	2002	DBLP DOI BibTeX RDF
23	Yumei Huo, Joseph Y.-T. Leung, Xin Wang	Integrated Production and Delivery Scheduling with Disjoint Windows.	COCOA	2009	DBLP DOI BibTeX RDF	Perishable goods, Parallel and identical machines, NP-hard and strong NP-hard, Fully polynomial time approximation schemes, Single machine
23	Bianca Schroeder, Garth A. Gibson	Understanding disk failure rates: What does an MTTF of 1, 000, 000 hours mean to you?	ACM Trans. Storage	2007	DBLP DOI BibTeX RDF	Hard drive replacements, annual failure rates, annual replacement rates, datasheet MTTF, failure correlation, hard drive failure, infant mortality, storage reliability, time between failure, wear-out, MTTF
23	Shang-Hua Teng, F. Frances Yao	Approximating Shortest Superstrings	FOCS	1993	DBLP DOI BibTeX RDF	superstring, shortest superstrings, Shortest Superstring Problem, approximation algorithms, data compression, NP-hard, DNA sequencing, MAX SNP-hard
22	Sergio Cabello, Bojan Mohar	Adding one edge to planar graphs makes crossing number hard.	SCG	2010	DBLP DOI BibTeX RDF	NP-hard, graph drawing, planar graphs, graph embedding, crossing number, topological graph theory
22	Yann Riche, Nathalie Henry Riche, Petra Isenberg, Anastasia Bezerianos	Hard-to-use interfaces considered beneficial (some of the time).	CHI Extended Abstracts	2010	DBLP DOI BibTeX RDF	easy-to-use, hard-to-use, usability, user interfaces, collaboration, communication, user experience
22	Nobuhito Yamamoto, Tomoyuki Nishioka, Syoko Shiroma	Building Problem Spaces for Deaf and Hard of Hearing Students' Spatial Cognition in a Programming Language.	HCI (7)	2009	DBLP DOI BibTeX RDF	Hyperlogo, Deaf and Hard of hearing, Turtle graphics, Programming Languages, Spatial Cognition, Communication tool
22	Anna Carpenter Cavender, Jeffrey P. Bigham, Richard E. Ladner	ClassInFocus: enabling improved visual attention strategies for deaf and hard of hearing students.	ASSETS	2009	DBLP DOI BibTeX RDF	deaf and hard of hearing users, multimedia conferencing technology, classroom technology
22	John M. Hitchcock, María López-Valdés, Elvira Mayordomo	Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Effective dimension, Scaled dimension, Turing-hard sets, Kolmogorov complexity
22	Robert W. Irving, David F. Manlove	Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Weak stability, Approximation algorithms, NP-hard problems, Stable matching
22	Laura Cruz Reyes, Diana Maritza Nieto-Yáñez, Pedro Tomás-Solis, Guadalupe Castilla Valdez	Solving Bin Packing Problem with a Hybridization of Hard Computing and Soft Computing.	Innovations in Hybrid Intelligent Systems	2008	DBLP DOI BibTeX RDF	hard computing, genetic algorithms, soft computing, hybrid intelligent system, bin packing problem
22	Fabiano Cruz, Raimundo S. Barreto, Lucas C. Cordeiro	Towards a model-driven engineering approach for developing embedded hard real-time software.	SAC	2008	DBLP DOI BibTeX RDF	DSL engineering, embedded hard real-time systems, tool-based approaches, petri nets, model-driven engineering, software synthesis
22	Robert J. Hall 0001	Rteq: modeling and validating infinite-state hard-real-time systems.	ASE	2007	DBLP DOI BibTeX RDF	GSTView, ISAT, OMML, openmodel, validation, reactive system, hard real time
22	Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff	A Hard Dial-a-Ride Problem that is Easy on Average.	J. Sched.	2005	DBLP DOI BibTeX RDF	approximation algorithm, NP-hard, average-case analysis
22	Eduardo Tavares, Paulo Romero Martins Maciel, Arthur Bessa, Raimundo S. Barreto, Leonardo Barros, Meuse N. Oliveira Jr., Ricardo Massa Ferreira Lima	A time petri net based approach for embedded hard real-time software synthesis with multiple operational modes.	SBCCI	2005	DBLP DOI BibTeX RDF	embedded hard real-time systems, hardware/software codesign methodologies, software synthesis
22	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Graph modification, Search tree algorithms, Automated development and analysis of algorithms, Exact algorithms, NP-hard problems, Algorithm engineering
22	Raimundo S. Barreto, Marília Neves, Meuse N. Oliveira Jr., Paulo Romero Martins Maciel, Eduardo Tavares, Ricardo Massa Ferreira Lima	A formal software synthesis approach for embedded hard real-time systems.	SBCCI	2004	DBLP DOI BibTeX RDF	embedded hard real-time systems, hardware/software codesign methodologies, software synthesis
22	George Marconi de Araujo Lima, Alan Burns 0001	An Optimal Fixed-Priority Assignment Algorithm for Supporting Fault-Tolerant Hard Real-Time Systems.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	priority assignment algorithm, fault tolerance, schedulability analysis, Hard real-time systems
22	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
22	José L. Pérez-Córdoba, Antonio J. Rubio, Juan M. López-Soler, M. Carmen Benítez	Hard-Decision in COVQ over Waveform Channels.	Data Compression Conference	2000	DBLP DOI BibTeX RDF	COVQ, Gaussian channels, flat-fading Rayleigh channels, hard-decision, diversity techniques, PSK and QAM modulation
22	Alan A. Bertossi, Luigi V. Mancini, Federico Rossini	Fault-Tolerant Rate-Monotonic First-Fit Scheduling in Hard-Real-Time Systems.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	Fault tolerance, multiprocessor systems, hard-real-time systems, periodic tasks, rate-monotonic scheduling, task replication
22	M. A. El-Gamal, Mohamed Fathy Abu El-Yazeed	A Combined Clustering and Neural Network Approach for Analog Multiple Hard Fault Classification.	J. Electron. Test.	1999	DBLP DOI BibTeX RDF	multiple hard faults, fault clustering, learning vector quantization neural networks, feature selection, analog circuits, fault classification
22	Michael E. Thomadakis, Jyh-Charn Liu	On the Efficient Scheduling of Non-Periodic Tasks in Hard Real-Time Systems.	RTSS	1999	DBLP DOI BibTeX RDF	Hard Real-Time Tasks, Sporadic, Aperiodic Scheduling, Idle-Capacity Management, FPF/LDL Schedules, Task Relocation, Periodic, Fixed Priority Preemptive Scheduling
22	Tarek F. Abdelzaher, Kang G. Shin	Comment on "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems''.	IEEE Trans. Software Eng.	1997	DBLP DOI BibTeX RDF	Pre-run-time scheduling, branch and bound scheduling algorithm, multiprocessors, hard real-time systems, precedence constraints
22	Matthew Clegg, Keith Marzullo	A low-cost processor group membership protocol for a hard real-time distributed system.	RTSS	1997	DBLP DOI BibTeX RDF	processor group membership protocol, hard real-time distributed system, failure detection latency, processor time, bounded tax, broadcast message traffic, protocols, schedulability analysis, message complexity, shared resources, network bandwidth
22	Oscar González 0002, H. Shrikumar, John A. Stankovic, Krithi Ramamritham	Adaptive fault tolerance and graceful degradation under dynamic hard real-time scheduling.	RTSS	1997	DBLP DOI BibTeX RDF	adaptive fault tolerance, dynamic hard real-time scheduling, static redundancy allocation, variable environments, redundancy strategy, radar tracking software, AWACS, early warning aircraft, timing-centric performance metric, quality of service, fault tolerant computing, timing constraints, temporal constraints, resource constraints, QoS guarantees, graceful degradation
22	Javier Orozco, Ricardo Cayssials, Jorge Santos 0002, Edgardo Ferro	Precedence constraints in hard real-time distributed systems.	ICECCS	1997	DBLP DOI BibTeX RDF	hard real-time distributed systems, multitask-multiprocessor systems, taxonomic genus, tentative assignment, formally proved method, tentative assignments, real-time systems, NP-complete problem, precedence constraints
22	Robert Eigenmann, Josef A. Nossek	Modification of Hard-Limiting Multilayer Neural Networks for Confidence Evaluation.	ICDAR	1997	DBLP DOI BibTeX RDF	hard limiting neural networks, piecewise-linear decision boundaries, Confidence, probability density function
22	Alan T. Krantz	Analysis of an Efficient Algorithm for the Hard-Sphere Problem.	ACM Trans. Model. Comput. Simul.	1996	DBLP DOI BibTeX RDF	hard-sphere, manybody problem, algorithm, discrete simulation
22	Chang-Gun Lee, Young-Kuk Kim, Sang Hyuk Son, Sang Lyul Min, Chong-Sang Kim	Efficiently supporting hard/soft deadline transactions in real-time database systems.	RTCSA	1996	DBLP DOI BibTeX RDF	hard/soft deadline transactions, temporally valid data objects, soft-deadlines, real-time systems, timing constraints, temporal consistency, real-time database systems, database operations, implementation complexity
22	Joshua Etkin, José Fridman	An Algorithm for Scheduling Prioritized Tasks in a Hard Real-Time Environment.	EUROMICRO	1996	DBLP DOI BibTeX RDF	prioritized tasks, hard real-time environment, processor scheduling, dynamically scheduling, search tree, event-driven simulation, priority ordering
22	Paulo Roberto Pierri Tepedino, Tereza G. Kirner	Specification and design of distributed hard real-time systems.	PDP	1995	DBLP DOI BibTeX RDF	distributed hard real-time systems, pre run time scheduling, HRTS, real-time systems, formal specification, graph theory, specification, distributed processing, software design, integrated approach, graph-based model
22	Hermann Kopetz	Why time-triggered architectures will succeed in large hard real-time systems.	FTDCS	1995	DBLP DOI BibTeX RDF	large hard real-time systems, encapsulated subsystems, temporal firewalls, sparse time base, replica determinism, time-triggered communication protocol, real-time systems, computational complexity, computer architecture, design principles, time-triggered architectures
22	Michael González Harbour, Mark H. Klein, John P. Lehoczky	Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	periodic task set, fixed-priority methods, serially executed subtasks, complex priority structure, nonpreemptible sections, scheduling, schedulability, real-time systems, robots, robotics, message passing, interrupts, interrupts, timing analysis, execution time, hard real-time systems, fixed-priority scheduling, precedence constraints, periodic tasks, message-passing systems, synchronization protocols, uniprocessor
22	Peter Eades, Sue Whitesides	The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.	SCG	1994	DBLP DOI BibTeX RDF	tree, NP-hard, spanning tree, graph drawing, graph layout
22	Jia Xu, David Lorge Parnas	On Satisfying Timing Constraints in Hard-Real-Time Systems.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	pre-run-time scheduling, mathematical scheduling problems, scheduling, real-time systems, timing constraints, operating systems (computers), hard-real-time systems
22	Terry Shepard, J. A. Martin Gagné	A Pre-Run-Time Scheduling Algorithm For Hard Real-Time Systems.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	pre-run-time scheduling algorithm, process sequencing, multiprocessor applications, preemptable processes, arbitrary precedence, exclusion constraints, branch-and-bound implicit enumeration technique, F-18 mission computer operational flight program, scheduling, real-time systems, multiprocessing systems, deadlines, computation times, hard real-time systems, aerospace computing, release times, feasible schedule, timing specifications
22	Michael L. Dertouzos, Aloysius K. Mok	Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	hard-real-time task scheduling, scheduling game representation, a priori knowledge, mutual exclusion constraints, scheduling, real-time systems, multiprocessing systems, multiprogramming, optimal scheduling, multiprocessor environment
22	Hung-Chang Du	Distributing a database for Parallel Processing is NP-hard.	SIGMOD Rec.	1984	DBLP DOI BibTeX RDF	parallel Processing, database, NP-hard
22	Kam-yiu Lam, Tei-Wei Kuo, Wai-Hung Tsang	Concurrency control for real-time database systems with mixed transactions.	RTCSA	1997	DBLP DOI BibTeX RDF	mixed transactions, data conflicts, optimistic concurrency control with broadcast commit, OCC-BC, hard real-time transactions, schedulability, concurrency control, concurrency control, real-time database systems
22	Hugh Anderson, Siau-Cheng Khoo	Improving Responsiveness of Hard Real-Time Embedded Systems.	TASE	2009	DBLP DOI BibTeX RDF
22	Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu	On the Complexity of Hard-Core Set Constructions.	ICALP	2007	DBLP DOI BibTeX RDF
22	Oguzhan Urhan, M. Kemal Güllü, Sarp Ertürk	Modified phase-correlation based robust hard-cut detection with application to archive film.	IEEE Trans. Circuits Syst. Video Technol.	2006	DBLP DOI BibTeX RDF
22	Simin Dai, Elaheh Bozorgzadeh	CAD Tool for FPGAs with Embedded Hard Cores for Design Space Exploration of Future Architectures.	FCCM	2006	DBLP DOI BibTeX RDF
22	Emanuele Viola	The complexity of constructing pseudorandom generators from hard functions.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	68Q01, Subject classification
22	Hongyu Guo, Herna L. Viktor	Boosting with Data Generation: Improving the Classification of Hard to Learn Examples.	IEA/AIE	2004	DBLP DOI BibTeX RDF
22	Steven J. Vaughan-Nichols	Hard Drive Technology Reaches a Turning Point.	Computer	2003	DBLP DOI BibTeX RDF
22	Mikael Goldmann, Alexander Russell	Spectral Bounds on General Hard Core Predicates.	STACS	2000	DBLP DOI BibTeX RDF
22	Ján Manuch	Multiparty Communication Complexity: Very Hard Functions.	MFCS	1999	DBLP DOI BibTeX RDF
20	Mark R. Beaumont, Chris North 0002, Bradley D. Hopkins, Ken Yiu	Hard Disk Guard Based Policy Enforcement.	POLICY	2011	DBLP DOI BibTeX RDF	access control, information security, hard disks
20	Omer Khan, Sandip Kundu	Thread Relocation: A Runtime Architecture for Tolerating Hard Errors in Chip Multiprocessors.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	hard-error tolerance, virtualization, Chip multiprocessor (CMP), hardware/software codesign, hypervisor
20	Stuart E. Schechter, Gabriel H. Loh, Karin Strauss, Doug Burger	Use ECP, not ECC, for hard failures in resistive memories.	ISCA	2010	DBLP DOI BibTeX RDF	hard failures, resistive memories, memory, error correction, phase change memory
20	Vipul Agarwal, Chiranjib Bhattacharyya, Thirumale Niranjan, Sai Susarla	Discovering Rules from Disk Events for Predicting Hard Drive Failures.	ICMLA	2009	DBLP DOI BibTeX RDF	Hard drive failures, SMART, False alarm rate
20	Fagui Liu, Zexiang Wu, Weipeng Mai	Renewal-Theory-Based Hard Disk Power Management Strategy Optimization.	NCM	2009	DBLP DOI BibTeX RDF	dynamic power management for hard disk, strategy optimization, low-power, renewal theory
20	Hyun-Joo Kim, Jung-Guk Kim, Chun-Hyon Chang, Sunyoung Han, Shin Hue	An Efficient Task Serializer for Hard Real-Time TMO Systems.	ISORC	2008	DBLP DOI BibTeX RDF	Task Serializer, TMO, Hard Real-time Systems
20	Cameron Laird	Taking a Hard-Line Approach to Encryption.	Computer	2007	DBLP DOI BibTeX RDF	Encryption-enabled hard drives, information security, Data encryption
20	Laszlo Hars	Discryption: Internal Hard-Disk Encryption for Secure Storage.	Computer	2007	DBLP DOI BibTeX RDF	Discryption, hard-disk encryption, security, data storage
20	Christo Angelov, Jesper Berthing	Distributed Timed Multitasking - A Model of Computation for Hard Real-Time Distributed Systems.	DIPES	2006	DBLP DOI BibTeX RDF	hard real-time distributed systems, actor-based architecture, signal-based communication, timed multitasking
20	Rajesh Garg, Nikhil Jayakumar, Sunil P. Khatri, Gwan Choi	A design approach for radiation-hard digital electronics.	DAC	2006	DBLP DOI BibTeX RDF	radiation-hard, SEU
20	Maria A. Osorio, German Cuaya-Simbro	Hard Problem Generation for MKP.	ENC	2005	DBLP DOI BibTeX RDF	Multdimensional Knapsack Problem, Hard Problems Generation, Integer Programming
20	Flavius Gruian	Hard real-time scheduling for low-energy using stochastic data and DVS processors.	ISLPED	2001	DBLP DOI BibTeX RDF	scheduling, low-energy, hard real-time, RTOS
20	Nicolas J. Cerf, Lov K. Grover, Colin P. Williams	Nested Quantum Search and NP-Hard Problems.	Appl. Algebra Eng. Commun. Comput.	2000	DBLP DOI BibTeX RDF	Combinatorial search problems, Quantum computation, NP-hard problems, Quantum algorithms
20	Byung-Kyu Choi, Riccardo Bettati	Efficient resource management for hard real-time communication over differentiated services architectures.	RTCSA	2000	DBLP DOI BibTeX RDF	hard real-time communication, differentiated services architectures, sink trees, admission probability, link resource utilization, resource allocation, resource management, heuristic algorithm, NP-complete problem, resource reservation, computer network management, telecommunication services, simulation experiments
20	Sijing Zhang, E. Stewart Lee	Efficient Global Allocation of Synchronous Bandwidths for Hard Real-Time Communication with the Timed Token MAC Protocol.	RTCSA	1999	DBLP DOI BibTeX RDF	Hard real-time communication, timed token medium access control protocol, synchronous bandwidth allocation (SBA), global/local SBA schemes, FDDI networks, synchronous messages
20	Stefan M. Petters, Annette Muth, Thomas Kolloch, Thomas Hopfner, Franz Fischer, Georg Färber	The REAR Framework for Emulation and Analysis of Embedded Hard Real-Time Systems .	IEEE International Workshop on Rapid System Prototyping	1999	DBLP DOI BibTeX RDF	rapid prototyping, timing constraints, schedulability analysis, SDL, design automation, hard real-time, WCET-analysis
20	Jeffrey J. P. Tsai, Bing Li, Eric Y. T. Juan	Transaction integration for reusable hard real-time components.	HASE	1996	DBLP DOI BibTeX RDF	transaction integration, reusable hard real time components, end to end timing requirements, framework based approach, data flow path, component interfaces, placeholders, reusable real time components, software reusability
20	Michelle Gower, Ralph W. Wilkerson	R-by-C Crozzle: an NP-hard problem.	SAC	1996	DBLP DOI BibTeX RDF	Crozzle, complexity, NP-hard
20	Carsten Rössner, Jean-Pierre Seifert	Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard.	MFCS	1996	DBLP DOI BibTeX RDF	2-prover 1-round interactive proof-systems, computational complexity, approximation algorithm, NP-hard, probabilistically checkable proofs, Diophantine approximation
20	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
20	Mitsunori Ogihara	Sparse P-Hard Sets Yield Space-Efficient Algorithms.	FOCS	1995	DBLP DOI BibTeX RDF	sparse P-hard sets, space-efficient algorithms, logspace many-one reductions, poly-logarithmic space-computable many-one reductions, computational complexity
20	Keumog Ahn, Sartaj Sahni	NP-Hard Module Rotation Problems.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	NP-hard module rotation problems, circuit modules, performance, computational complexity, circuit layout CAD, circuit layout CAD, routability