Search results for "NP-hard"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Sungyoung Lee, Hyungill Kim, Jongwon Lee	A soft aperiodic task scheduling algorithm in dynamic-priority systems.	RTCSA	1995	DBLP DOI BibTeX RDF	soft aperiodic task scheduling algorithm, dynamic-priority systems, joint scheduling, hard deadline periodic tasks, soft deadline aperiodic tasks, fixed-critical task indicating algorithm, deadlinewise preassignment table, computational complexity, computational complexity, processor scheduling
14	Abdel-Fattah Yousif, Jun Gu	Concurrent automatic test pattern generation algorithm for combinational circuits.	ICCD	1995	DBLP DOI BibTeX RDF	concurrent automatic test pattern generation algorithm, global computations techniques, concurrent search, ISCAS'85, ISCAS'89 benchmarks, computational complexity, logic testing, NP-hard, combinational circuits, combinational circuits, automatic testing
14	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
14	Allison Woodruff, Michael Stonebraker	Buffering of Intermediate Results in Dataflow Diagrams.	VL	1995	DBLP DOI BibTeX RDF	optimal buffer allocation, buffer contents, user requests, latency reduction techniques, history mechanisms, query response time, visual dataflow languages, Tioga, graphical application development tool, software tools, latency, visual programming, NP-hard, data flow analysis, buffer management, diagrams, buffer storage, storage allocation, heuristic programming, heuristic methods, application generators, performance enhancements, average response time, dataflow diagrams
14	Carl I. Birkinshaw, Peter R. Croll	Modelling the client-server behaviour of parallel real-time systems using Petri nets.	HICSS (2)	1995	DBLP DOI BibTeX RDF	client-server behaviour modelling, parallel real-time systems, communication behaviour, potential livelock, client-server behaviour graph, real-time systems, computational complexity, parallel programming, Petri nets, Petri nets, parallel machines, deadlock, client-server systems, hard real-time system, timeliness, communication structure, state explosion problem
14	Mark Russinovich, Zary Segall	Application-transparent checkpointing in Mach 3.O/UX.	HICSS (1)	1995	DBLP DOI BibTeX RDF	application-transparent checkpointing, Mach 3/UX, software based recovery techniques, virtual memory checkpointing algorithms, concurrent Unix applications, stable storage medium, snapshot algorithm execution, checkpoint commit execution, disk storage requirement, external pager facility, parallel programming, distributed computation, Unix, Unix, system recovery, software fault tolerance, operating systems (computers), system performance, virtual storage, concurrent processes, hard disk
14	Dimitrios Karayiannis, Spyros Tragoudas	Uniform area timing-driven circuit implementation.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	circuit module, cell library, input-output paths, overall area, timing-driven circuit implementation, computational complexity, heuristics, CAD, delays, timing, sequential circuits, sequential circuits, NP-hard, directed graphs, combinational circuits, combinational circuits, logic CAD, polynomial time algorithm, directed acyclic graphs, circuit CAD, cellular arrays, propagation delay
14	Xinli Gu	RT level testability-driven partitioning.	VTS	1995	DBLP DOI BibTeX RDF	testability-driven partitioning, RT level designs, hard-to-test points, testability analysis algorithm, normal mode, design function, test mode, acyclic partition, BIST technique, fault diagnosis, logic testing, built-in self test, integrated circuit testing, design for testability, ATPG, automatic testing, logic CAD, fault coverage, logic partitioning, test application time, data path, testability measurements, DFT techniques
14	Rajat Kumar Pal, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal	Computing area and wire length efficient routes for channels.	VLSI Design	1995	DBLP DOI BibTeX RDF	area efficient routes, wire length efficient routes, total wire length reduction, multilayer routing solutions, computational complexity, VLSI, NP-hard, polynomial time algorithms, network routing, circuit layout CAD, minimisation, VLSI layout, integrated circuit layout, channel routing
14	Edwin S. H. Hou, Nirwan Ansari, Hong Ren	A Genetic Algorithm for Multiprocessor Scheduling.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	robust stochastic search algorithms, random task graphs, robot inverse dynamics computational task graph, genetic algorithms, genetic algorithm, simulation, scheduling, performance evaluation, optimization, computational complexity, optimisation, multiprocessing systems, NP-hard, heuristic search, multiprocessor scheduling, list scheduling
14	Chunming Qiao, Rami G. Melhem	Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	MIN's, multiprocessor communications, TDM-MIN's, N time slots, n-dimensional hypercubes, Markov analysis, partition of connection requests, partitioning, mappings, reconfiguration, multiprocessor interconnection networks, embedding, meshes, NP-hard, multistage interconnection networks, optical interconnects, rings, binary trees, shift registers, time division multiplexing, time division multiplexed, round-robin, cube-connected-cycles
14	Gerardo Beni, Xiaomin Liu	A Least Biased Fuzzy Clustering Method.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	least biased fuzzy clustering method, minimal biases, clustering entropy, hard partitions, relative stability, cluster structure, pattern recognition, entropy, fuzzy set theory, multiscale analysis, fuzzy partitions, maximum entropy principle
14	Jia Xu	Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	exclusion relations, nonpreemptive schedule, automated pre-run-time scheduling, scheduling, real-time systems, multiprocessing systems, deadlines, multiprocessor scheduling, hard-real-time systems, release times, precedence
14	Bernd J. Krämer, Luqi, Valdis Berzins	Compositional Semantics of a Real-Time Prototyping Language.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	real-time prototyping language, PSDL, data flow notation, application-orientation timing, control constraints, algebraic high-level Petri nets, concurrency concepts, real-time systems, formal specification, Petri nets, synchronization, specification languages, abstract data types, abstract data types, formal semantics, algebraic specifications, software prototyping, hard real-time systems, compositional semantics, timing behavior
14	Paul Helman, Gunar E. Liepins	Statistical Foundations of Audit Trail Analysis for the Detection of Computer Misuse.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	audit trail analysis, computer misuse, computer transactions, stationary stochastic processes, misuse detectors, detection accuracy, transaction attributes, statistical foundations, modeling, transaction processing, NP-hard, security of data, stochastic processes, auditing, density estimation, system security, computer crime, heuristic approach
14	Jia Xu, David Lorge Parnas	Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	single processor, exclusion relations, ordered pairs, process segments, automated pre-run-time scheduling, arbitrary precedence, scheduling, optimisation, search problems, hard-real-time systems, optimal schedule, release time, precedence relations
14	Valmir Carneiro Barbosa	Strategies for the Prevention of Communication Deadlocks in Distributed Parallel Programs.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	randomly generated systems, distributed parallel programs, unavailability, message buffers, message buffering space, buffer usage, NP-hard optimization problems, computational complexity, parallel programming, concurrency, heuristic, upper bounds, programming theory, communication channels, deadlock prevention, process execution, communication deadlocks
14	Shlomo Moran	On the Complexity of Designing Optimal Partial-Match Retrieval Systems.	ACM Trans. Database Syst.	1983	DBLP DOI BibTeX RDF	approximation algorithms, searching, hashing, NP-hard problems, file organization, partial match retrieval
14	Kyungchun Lee, Lajos Hanzo	MIMO-assisted hard versus soft decoding-and-forwarding for network coding aided relaying systems.	IEEE Trans. Wirel. Commun.	2009	DBLP DOI BibTeX RDF
14	Martin Hoefer 0001, Lars Olbrich, Alexander Skopalik	Doing Good with Spam Is Hard.	SAGT	2009	DBLP DOI BibTeX RDF
14	Tongquan Wei, Xiaodao Chen, Piyush Mishra	Designing a multi-core hard real-time test bed for energy measurement experiments.	SAC	2009	DBLP DOI BibTeX RDF
14	Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao	Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard.	CPM	2009	DBLP DOI BibTeX RDF	3sum, wildcard matching, k-mismatches, alignment, run-length encoding
14	Soumaya Hamouda, Choong Il Yeh, Jihyung Kim, Wooram Shin, Dong Seung Kwon	Dynamic Hard Fractional Frequency Reuse for Mobile WiMAX.	PerCom Workshops	2009	DBLP DOI BibTeX RDF
14	Rodica Mihai, Ioan Todinca	Pathwidth is NP-Hard for Weighted Trees.	FAW	2009	DBLP DOI BibTeX RDF
14	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi	The k-Anonymity Problem Is Hard.	FCT	2009	DBLP DOI BibTeX RDF
14	Christophe Petit 0001, Jean-Jacques Quisquater, Jean-Pierre Tillich, Gilles Zémor	Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security.	CT-RSA	2009	DBLP DOI BibTeX RDF
14	Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx	Planar Capacitated Dominating Set Is W[1]-Hard.	IWPEC	2009	DBLP DOI BibTeX RDF
14	Qixin Wang, Rong Zheng 0001, Ajay Tirumala, Xue Liu 0001, Lui Sha	Lightning: A Hard Real-Time, Fast, and Lightweight Low-End Wireless Sensor Election Protocol for Acoustic Event Localization.	IEEE Trans. Mob. Comput.	2008	DBLP DOI BibTeX RDF	Wireless sensor networks, Real time, Pervasive computing, Location-dependent and sensitive
14	Yanching Chu, Alan Burns 0001	Flexible hard real-time scheduling for deliberative AI systems.	Real Time Syst.	2008	DBLP DOI BibTeX RDF	Real-time AI, Deliberative agents, Optimal priority ordering, Fixed priority scheduling, Response time analysis
14	Qi Cheng 0001	Hard Problems of Algebraic Geometry Codes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
14	Deniss Kumlander	NP-Hard Graph Problems' Algorithms Testing Guidelines: Artificial Intelligence Principles and Testing as a Service.	Innovative Techniques in Instruction Technology, E-learning, E-assessment, and Education	2008	DBLP DOI BibTeX RDF
14	Bogdan F. Romanescu, Daniel J. Sorin	Core cannibalization architecture: improving lifetime chip performance for multicore processors in the presence of hard faults.	PACT	2008	DBLP DOI BibTeX RDF	lifetime performance, fault tolerance, reliability, multicore
14	Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre	Alternatives to Truthfulness Are Hard to Recognize.	SAGT	2008	DBLP DOI BibTeX RDF
14	David Tung Chong Wong, Francois P. S. Chin, Anh Tuan Hoang, Ying-Chang Liang	Saturated throughput of PCA with Hard DRPs in Cognitive WiMedia MAC.	VTC Spring	2008	DBLP DOI BibTeX RDF
14	Viacheslav Izosimov, Paul Pop, Petru Eles, Zebo Peng	Scheduling of Fault-Tolerant Embedded Systems with Soft and Hard Timing Constraints.	DATE	2008	DBLP DOI BibTeX RDF
14	Viacheslav Izosimov, Paul Pop, Petru Eles, Zebo Peng	Synthesis of Flexible Fault-Tolerant Schedules with Preemption for Mixed Soft and Hard Real-Time Systems.	DSD	2008	DBLP DOI BibTeX RDF
14	Marc Demange, Tínaz Ekim	Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs.	TAMC	2008	DBLP DOI BibTeX RDF	unmatched pairs, Minimum Maximal Matching, regular bipartite graphs, stable marriage
14	Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick	Entangled Games are Hard to Approximate.	FOCS	2008	DBLP DOI BibTeX RDF
14	Xin Chen, Hao Yin, Yongjun Zhou, Jianxiong Wan	An Effective Framework for Delay Control in Hard Real-Time Switched Networks.	HPCC	2008	DBLP DOI BibTeX RDF
14	Raju Hormis, Xiaodong Wang 0001	Iterative equalization with hard and soft decisions for ISI-constrained channels.	ICASSP	2008	DBLP DOI BibTeX RDF
14	Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger	How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?	WINE	2008	DBLP DOI BibTeX RDF	Network congestion game, makespan objective, extreme equilibria, complexity, unsplittable flow
14	David Tung Chong Wong, Francois P. S. Chin, Mangalam Ramakrishnan Shajan, Yong Huat Chew	Saturated Throughput of Burst Mode PCA with Hard DRPs in WiMedia MAC.	WCNC	2008	DBLP DOI BibTeX RDF
14	Jörg Mische, Sascha Uhrig, Florian Kluge, Theo Ungerer	Exploiting spare resources of in-order SMT processors executing hard real-time threads.	ICCD	2008	DBLP DOI BibTeX RDF
14	Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu	From High Girth Graphs to Hard Instances.	CP	2008	DBLP DOI BibTeX RDF
14	Qiaozhu Mei, Kenneth Ward Church	Entropy of search logs: how hard is search? with personalization? with backoff?	WSDM	2008	DBLP DOI BibTeX RDF	personalization with backoff, search difficulty, entropy, demographics, search log
14	C. Richard Ho, Michael Theobald, Martin M. Deneroff, Ron O. Dror, Joseph Gagliardo, David E. Shaw	Early formal verification of conditional coverage points to identify intrinsically hard-to-verify logic.	DAC	2008	DBLP DOI BibTeX RDF	conditional coverage, inconclusive results, formal verification, code coverage, verifiability, coverage hole
14	Haipeng Guo, William H. Hsu	A machine learning approach to algorithm selection for NP\mathcal{NP} -hard optimization problems: a case study on the MPE problem.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF
14	Anthony Hylick, Andrew C. Rice, Brian Jones, Ripduman Sohan	Hard drive power consumption uncovered.	SIGMETRICS Perform. Evaluation Rev.	2007	DBLP DOI BibTeX RDF
14	Eduardo Tavares, Raimundo S. Barreto, Paulo Romero Martins Maciel, Meuse N. Oliveira Jr., Leonardo Amorim, Fernando Rocha, Ricardo Massa Ferreira Lima	Software synthesis for hard real-time embedded systems with multiple processors.	ACM SIGSOFT Softw. Eng. Notes	2007	DBLP DOI BibTeX RDF	petri nets, real-time embedded systems, software synthesis, multiple processors
14	Carsten Wegener, Michael Peter Kennedy	Hard-Fault Detection and Diagnosis During the Application of Model-Based Data Converter Testing.	J. Electron. Test.	2007	DBLP DOI BibTeX RDF	Mixed-signal and analog test, Test and diagnosis methodologies, Converter testing, Output response analysis
14	Benjamin Doerr	Roundings Respecting Hard Constraints.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
14	Giuseppe Caire, Ralf R. Müller, Raymond Knopp	Hard Fairness Versus Proportional Fairness in Wireless Communications: The Single-Cell Case.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
14	Paula Thomas, Theodore Tryfonas	Hard-drive Disposal and Identity Fraud.	SEC	2007	DBLP DOI BibTeX RDF
14	Björn B. Brandenburg, James H. Anderson	Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors.	ECRTS	2007	DBLP DOI BibTeX RDF
14	Hidetomo Ichihashi, Katsuhiro Honda, Naho Kuwamoto, Takao Hattori	Post-supervised Fuzzy c-Means Classifier with Hard Clustering.	CIDM	2007	DBLP DOI BibTeX RDF
14	Mohmmad Anas, Francesco Davide Calabrese, Preben E. Mogensen, Claudio Rosa, Klaus I. Pedersen	Performance Evaluation of Received Signal Strength Based Hard Handover for UTRAN LTE.	VTC Spring	2007	DBLP DOI BibTeX RDF
14	Ahad Ali, Robert de Souza	Modeling and simulation of hard disk dive final assembly using a HDD template.	WSC	2007	DBLP DOI BibTeX RDF
14	Mercedes G. Merayo, Manuel Núñez 0001, Ismael Rodríguez	Formal Testing of Systems Presenting Soft and Hard Deadlines.	FSEN	2007	DBLP DOI BibTeX RDF
14	Eduardo Tavares, Paulo Romero Martins Maciel, Bruno Silva 0001, Meuse N. Oliveira Jr., Rafael Rodrigues, Renato Marques	Dynamic Voltage Scaling in hard real-time systems considering precedence and exclusion relations.	SMC	2007	DBLP DOI BibTeX RDF
14	Jun Li, Fumin Yang, Gang Tu, Wan-hua Cao, Yansheng Lu	Schedulability Analysis of the Fault-Tolerant Hard Real-Time Tasks with Limited Priority Levels.	ATC	2007	DBLP DOI BibTeX RDF
14	Ilan Newman, Yuri Rabinovich	Hard Metrics from Cayley Graphs of Abelian Groups.	STACS	2007	DBLP DOI BibTeX RDF
14	Friedrich Fraundorfer, Henrik Stewénius, David Nistér	A Binning Scheme for Fast Hard Drive Based Image Search.	CVPR	2007	DBLP DOI BibTeX RDF
14	Laurent Fournier, Avi Ziv	Using Virtual Coverage to Hit Hard-To-Reach Events.	Haifa Verification Conference	2007	DBLP DOI BibTeX RDF
14	Sule Ozev, Daniel J. Sorin, Mahmut Yilmaz	Low-cost run-time diagnosis of hard delay faults in the functional units of a microprocessor.	ICCD	2007	DBLP DOI BibTeX RDF
14	Timothy Bisson, Scott A. Brandt	Flushing Policies for NVCache Enabled Hard Disks.	MSST	2007	DBLP DOI BibTeX RDF
14	William S. Oakley	E-Beam Hard Disk Drive Using Gated Carbon Nano Tube Source and Phase Change Media.	MSST	2007	DBLP DOI BibTeX RDF
14	Vincenzo Nicosia	Towards hard real-time Erlang.	Erlang Workshop	2007	DBLP DOI BibTeX RDF	scheduling, real time, erlang
14	Kurt Hornik, Walter Böhm	Hard and Soft Euclidean Consensus Partitions.	GfKl	2007	DBLP DOI BibTeX RDF
14	Yu-Wang Chen, Yong-Zai Lu	Gene Optimization: Computational Intelligence from the Natures and Micro-mechanisms of Hard Computational Systems.	LSMS (1)	2007	DBLP DOI BibTeX RDF
14	Clark Quinn	Hard Fun: Cognition and Emotion at Play.	DIGITEL	2007	DBLP DOI BibTeX RDF
14	Renqiu Wang, Georgios B. Giannakis	Approaching MIMO channel capacity with soft detection based on hard sphere decoding.	IEEE Trans. Commun.	2006	DBLP DOI BibTeX RDF
14	Charlene O'Hanlon	What's on your hard drive?	ACM Queue	2006	DBLP DOI BibTeX RDF
14	Pengliu Tan, Hai Jin 0001, Minghu Zhang	A Hybrid Scheduling Scheme for Hard, Soft and Non-Real-time Tasks.	ISORC	2006	DBLP DOI BibTeX RDF
14	Ridya C. Vidya, H. D. Phaneendra, M. S. Shivakumar	Quantum Algorithms and Hard Problems.	IEEE ICCI	2006	DBLP DOI BibTeX RDF
14	Iftach Haitner, Danny Harnik, Omer Reingold	Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.	ICALP (2)	2006	DBLP DOI BibTeX RDF
14	Myung-Kyun Kim, Hee Chan Lee	Periodic Message Scheduling on a Switched Ethernet for Hard Real-Time Communication.	HPCC	2006	DBLP DOI BibTeX RDF
14	Hermann Gruber, Markus Holzer 0001	Finding Lower Bounds for Nondeterministic State Complexity Is Hard.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
14	Kyong Hoon Kim, Jong Kim 0001	An Energy-Efficient FEC Scheme for Weakly Hard Real-Time Communications in Wireless Networks.	RTCSA	2006	DBLP DOI BibTeX RDF
14	Fernando Esponda, Elena S. Ackley, Paul Helman, Haixia Jia, Stephanie Forrest	Protecting Data Privacy Through Hard-to-Reverse Negative Databases.	ISC	2006	DBLP DOI BibTeX RDF
14	Yang Chang, Andy J. Wellings	Hard Real-Time Hybrid Garbage Collection with Low Memory Requirements.	RTSS	2006	DBLP DOI BibTeX RDF
14	Matthias Müller-Hannemann, Anna Schulze	Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.	SWAT	2006	DBLP DOI BibTeX RDF
14	Hidetomo Ichihashi, Katsuhiro Honda, Akira Notsu	Postsupervised Hard c-Means Classifier.	RSCTC	2006	DBLP DOI BibTeX RDF
14	Jesper Torp Kristensen, Peter Bro Miltersen	Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard.	COCOON	2006	DBLP DOI BibTeX RDF
14	Benjamin W. Wah, Zhe Wu 0002	Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	techniques of algorithms, penalty formulation, search, constraint satisfaction, Boolean satisfiability, knowledge representation and reasoning, saddle point
14	Ismail Demirkan, Jack K. Wolf	Block codes for the hard-square model.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
14	Martín Abadi, Michael Burrows, Mark S. Manasse, Ted Wobber	Moderately hard, memory-bound functions.	ACM Trans. Internet Techn.	2005	DBLP DOI BibTeX RDF	Spam
14	André Luiz de Freitas Francisco, Franz J. Rammig	Fault-Tolerant Hard-Real-Time Communication of Dynamically Reconfigurable, Distributed Embedded Systems.	ISORC	2005	DBLP DOI BibTeX RDF
14	Thomas Watteyne, Isabelle Augé-Blum	Proposition of a Hard Real-Time MAC Protocol for Wireless Sensor Networks.	MASCOTS	2005	DBLP DOI BibTeX RDF
14	Lei Wang 0023, Mingde Zhao, Zengwei Zheng, Zhaohui Wu 0001	End-To-End Worst-Case Response Time Analysis for Hard Real-Time Distributed Systems.	SAFECOMP	2005	DBLP DOI BibTeX RDF
14	Jonathan Hallam, Adam Prügel-Bennett	Barrier-based models of hard problems and crossover.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
14	Wolfgang Faber 0001, Francesco Ricca	Solving Hard ASP Programs Efficiently.	LPNMR	2005	DBLP DOI BibTeX RDF
14	Minbo Li, Yoke San Wong, Yinsheng Li	Research on Collaborative Application Portal of Mould and Hard Disk Drive Industry.	CSCWD (Selected papers)	2005	DBLP DOI BibTeX RDF
14	Lei Wang 0023, Mingde Zhao, Zengwei Zheng, Zhaohui Wu 0001	Exact Best-Case End-to-End Response Time Analysis for Hard Real-Time Distributed Systems.	ISCIS	2005	DBLP DOI BibTeX RDF
14	Luis Alejandro Cortés, Petru Eles, Zebo Peng	Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks.	RTCSA	2005	DBLP DOI BibTeX RDF
14	Edith Elkind	True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs.	EC	2005	DBLP DOI BibTeX RDF	shortest paths, auction, mechanism design
14	Tarek A. AlEnawy, Hakan Aydin	Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems.	RTSS	2005	DBLP DOI BibTeX RDF
14	Alvaro Pardo	Simple and Robust Hard Cut Detection Using Interframe Differences.	CIARP	2005	DBLP DOI BibTeX RDF
14	Il-Hwan Kim, Kyung-Ho Sohn, Young Yong Kim, Keum Chan Whang	Modeling and Analysis of Impatient Packets with Hard Delay Bound in Contention Based Multi-access Environments for Real Time Communication.	ICOIN	2005	DBLP DOI BibTeX RDF
14	Philip D. MacKenzie, Sarvar Patel	Hard Bits of the Discrete Log with Applications to Password Authentication.	CT-RSA	2005	DBLP DOI BibTeX RDF
14	Alimujiang Yiming, Toshio Eisaka	A Switched Ethernet Protocol for Hard Real-Time Embedded System Applications.	AINA	2005	DBLP DOI BibTeX RDF