Search results for "NP-hard"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	Nikolai Joukov, Josef Sipek	GreenFS: making enterprise computers greener by protecting them better.	EuroSys	2008	DBLP DOI BibTeX RDF	continuous data protection, power efficiency, backup
16	Marcus Schaefer 0001, Frank Stephan 0001	Strong Reductions and Immunity for Exponential Time.	STACS	2003	DBLP DOI BibTeX RDF	hardness for exponential time, polynomial time reducibilities, Computational and structural complexity
16	Luca Trevisan	Non-approximability results for optimization problems on bounded degree instances.	STOC	2001	DBLP DOI BibTeX RDF
14	Guojun Li, Xiaotie Deng, Ying Xu 0001	A polynomial-time approximation scheme for embedding hypergraph in a cycle.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Hypergraph embedding, minimum congestion, NP-hard, polynomial-time approximation scheme
14	Wenqi Huang, Kun He 0001	A pure quasi-human algorithm for solving the cuboid packing problem.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	quasi-human approach, caving degree, heuristic, NP-hard, packing problem
14	David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf	Approximate topological matching of quad meshes.	Vis. Comput.	2009	DBLP DOI BibTeX RDF	Topological matching, Lazy-greedy heuristic, NP-complete, NP-hard, Isomorphism, Quad mesh
14	Andreas Willig	Memory-efficient segment-based packet-combining schemes in face of deadlines.	IWCMC	2009	DBLP DOI BibTeX RDF	hard-decision packet combining, memory-efficiency, stochastic/Markov modeling, deadline constraints
14	Feng Chen 0005, David A. Koufaty, Xiaodong Zhang 0001	Understanding intrinsic characteristics and system implications of flash memory based solid state drives.	SIGMETRICS/Performance	2009	DBLP DOI BibTeX RDF	hard disk drive, flash memory, solid state drive
14	Bianca Schroeder, Eduardo Pinheiro, Wolf-Dietrich Weber	DRAM errors in the wild: a large-scale field study.	SIGMETRICS/Performance	2009	DBLP DOI BibTeX RDF	dimm, dram reliability, ecc, hard error, empirical study, memory, soft error, dram, large-scale systems, data corruption
14	Hamed Ketabdar, Tim Polzehl	Tactile and visual alerts for deaf people by mobile phones.	ASSETS	2009	DBLP DOI BibTeX RDF	audio events, change of audio pattern, deaf or hard of hearing people, vibro-tactile and visual alerts, mobile phones
14	MingJian Tang 0001, Jinli Cao, Xiaohua Jia, Ke-Yan Liu	Optimization on Data Object Compression and Replication in Wireless Multimedia Sensor Networks.	DASFAA	2009	DBLP DOI BibTeX RDF	Data compression and replication, subgradient method, Optimization, NP-hard, Lagrangian relaxation, Wireless Multimedia Sensor Networks
14	Damien Le Moal, Donald Molaro, Jorge Campello	Power efficient real-time disk scheduling.	NOSSDAV	2009	DBLP DOI BibTeX RDF	real-time hard-disk scheduling, power consumption
14	Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa Raschid, Maria-Esther Vidal, Luis-Daniel Ibáñez, Héctor Rodríguez-Drumond	Flexible and efficient querying and ranking on hyperlinked data sources.	EDBT	2009	DBLP DOI BibTeX RDF	ObjectRank, authority flow ranking, hard filters, soft filters
14	Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond	How similarity helps to efficiently compute Kemeny rankings.	AAMAS (1)	2009	DBLP BibTeX RDF	structural parameterization, exact algorithm, NP-hard problem, fixed-parameter tractability, rank aggregation
14	Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo	Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Order scheduling, Total weighted completion time, Approximation algorithms, NP-hard
14	Hitoshi Kanoh, Souichi Tsukahara	Virus Evolution Strategy for Vehicle Routing Problems with Time Windows.	PPSN	2008	DBLP DOI BibTeX RDF	NP-hard class, evolution strategy, schema, Vehicle routing problem, virus, infection
14	Sotaro Ohara, Makoto Suzuki, Shunsuke Saruwatari, Hiroyuki Morikawa	A Prototype of a Multi-core Wireless Sensor Node for Reducing Power Consumption.	SAINT	2008	DBLP DOI BibTeX RDF	multi-core CPU, sensor network, hard real-time, low power consumption
14	Jack Whitham, Neil C. Audsley	Using Trace Scratchpads to Reduce Execution Times in Predictable Real-Time Architectures.	IEEE Real-Time and Embedded Technology and Applications Symposium	2008	DBLP DOI BibTeX RDF	wcet, reduction, trace, hard real-time, scratchpads
14	Mark J. Stanovich, Theodore P. Baker, An-I Andy Wang	Throttling On-Disk Schedulers to Meet Soft-Real-Time Requirements.	IEEE Real-Time and Embedded Technology and Applications Symposium	2008	DBLP DOI BibTeX RDF	hard disk drive, real-time, operating system, deadline, device driver
14	Shigeki Miyoshi, Hayato Kuroki, Sumihiro Kawano, Mayumi Shirasawa, Yasushi Ishihara, Masayuki Kobayashi	Support Technique for Real-Time Captionist to Use Speech Recognition Software.	ICCHP	2008	DBLP DOI BibTeX RDF	hard-of-hearing, Real-Time captioning, Speech recognition, deaf
14	Mark Lysinger, François Jacquet, Mehdi Zamanian, David McClure, Philippe Roche, Naren Sahoo, John Russell	A Radiation Hardened Nano-Power 8Mb SRAM in 130nm CMOS.	ISQED	2008	DBLP DOI BibTeX RDF	Rad Hard
14	Sayan Kumar Ray, Krzysztof Pawlikowski, Harsha R. Sirisena	A Fast MAC-Layer Handover for an IEEE 802.16e-Based WMAN.	AccessNets	2008	DBLP DOI BibTeX RDF	hard handover, backhaul network, ranging, IEEE 802.16e
14	Alexander Wolff 0001	Drawing Subway Maps: A Survey.	Inform. Forsch. Entwickl.	2007	DBLP DOI BibTeX RDF	Subway map, Octilinear layout, NP-hard, Graph drawing, Mixed-integer program, Graph labeling
14	Jianfeng Mao, Christos G. Cassandras, Qianchuan Zhao	Optimal Dynamic Voltage Scaling in Energy-Limited Nonpreemptive Systems with Real-Time Constraints.	IEEE Trans. Mob. Comput.	2007	DBLP DOI BibTeX RDF	nonpreemptive, sensor networks, optimal control, voltage scaling, Hard real-time system
14	Sun-Yuan Hsieh, Huang-Ming Gao	On the partial terminal Steiner tree problem.	J. Supercomput.	2007	DBLP DOI BibTeX RDF	The Steiner tree problem, The partial terminal Steiner tree problem, Approximation algorithms, NP-complete, MAX SNP-hard
14	Jan Reineke 0001, Daniel Grund, Christoph Berg, Reinhard Wilhelm	Timing predictability of cache replacement policies.	Real Time Syst.	2007	DBLP DOI BibTeX RDF	Predictability, Timing analysis, Hard real-time systems, Cache replacement policies, Cache analysis
14	Pi-Rong Sheu, Shan-Tai Chen	On the Hardness of Approximating the Multicast Delay Variation Problem.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	inter-destination delay variation, NP-complete, NP-hard, multicast routing, Inapproximability
14	Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink, Xueyi Wang	Faster placement of hydrogens in protein structures by dynamic programming.	ACM J. Exp. Algorithmics	2007	DBLP DOI BibTeX RDF	hard-sphere model, hydrogen bonds, hydrogen placement, Dynamic programming, treewidth, protein structure
14	Chuan-Ming Liu, Kun-Feng Lin	Disseminating dependent data in wireless broadcast environments.	Distributed Parallel Databases	2007	DBLP DOI BibTeX RDF	Latency, NP-hard, Directed acyclic graphs, Data broadcasting, Access pattern
14	Naotake Kamiura, Teijiro Isokawa, Nobuyuki Matsui	On Two-Pronged Power-Aware Voltage Scheduling for Multi-processor Real-Time Systems.	PATMOS	2007	DBLP DOI BibTeX RDF	voltage scheduling, dependent tasks, energy saving, hard real-time system
14	Tamjidul Hoque, Madhu Chetty, Laurence S. Dooley	Generalized Schemata Theorem Incorporating Twin Removal for Protein Structure Prediction.	PRIB	2007	DBLP DOI BibTeX RDF	Schemata theorem, twin removal, similarity in population, hard optimization problem, protein structure prediction
14	Mingji Xia	Maximum Edge-Disjoint Paths Problem in Planar Graphs.	TAMC	2007	DBLP DOI BibTeX RDF	maximum edge-disjoint paths, #P-hard, determinant
14	Frank Kammer	Determining the Smallest k Such That G Is k -Outerplanar.	ESA	2007	DBLP DOI BibTeX RDF	Outerplanarity index, k-outerplanar, SPQR trees, NP-hard, fixed-parameter algorithms
14	Feng Zhao 0005, Jiulun Fan 0001	Image Segmentation by Multi-level Thresholding Based on C-Means Clustering Algorithms and Fuzzy Entropy.	ICFIE	2007	DBLP DOI BibTeX RDF	Hard C-means clustering algorithm, Fuzzy C-means clustering algorithm, Image segmentation, Post-processing, Fuzzy entropy
14	Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi	Weak Visibility of Two Objects in Planar Polygonal Scenes.	ICCSA (1)	2007	DBLP DOI BibTeX RDF	weak visibility, 3sum-hard problems, object inter-visibility, Computational geometry
14	Deying Li 0001, Jiannong Cao 0001, Ming Liu 0002, Yuan Zheng 0001	K -Connected Target Coverage Problem in Wireless Sensor Networks.	COCOA	2007	DBLP DOI BibTeX RDF	k-connected target coverage, k-connected augmentation, wireless sensor networks, heuristic algorithms, NP-hard problems
14	Christer Sandberg, Andreas Ermedahl, Jan Gustafsson, Björn Lisper	Faster WCET flow analysis by program slicing.	LCTES	2006	DBLP DOI BibTeX RDF	hard real time, worst-case execution time analysis
14	Yi Peng 0001, Gang Kou, Yong Shi 0001, Zhengxin Chen	A Hybrid Strategy for Clustering Data Mining Documents.	ICDM Workshops	2006	DBLP DOI BibTeX RDF	Hard clustering, Data mining, Document clustering, Optimization algorithm, Grounded theory, Soft clustering
14	Juan Frausto Solís, Héctor Sanvicente Sánchez, Froilán Imperial-Valenzuela	ANDYMARK: An Analytical Method to Establish Dynamically the Length of the Markov Chain in Simulated Annealing for the Satisfiability Problem.	SEAL	2006	DBLP DOI BibTeX RDF	Optimization, Heuristics, Simulated Annealing, Combinatorial Optimization, Satisfiability, NP-Hard Problems
14	Xiaotie Deng, Qizhi Fang, Xiaoxun Sun	Finding nucleolus of flow game.	SODA	2006	DBLP DOI BibTeX RDF	LP duality, flow game, nucleolus, NP-hard, efficient algorithm
14	Fedor V. Fomin, Fabrizio Grandoni 0001, Dieter Kratsch	Measure and conquer: a simple O(20.288n) independent set algorithm.	SODA	2006	DBLP DOI BibTeX RDF	exponential-time exact algorithms, independent set problem, NP-hard problems, algorithms and data structures
14	Chor Ping Low	On Load-Balanced Semi-matchings for Weighted Bipartite Graphs.	TAMC	2006	DBLP DOI BibTeX RDF	semi-matching, approximation algorithm, load balancing, NP-hard, bipartite graphs
14	Sungpack Hong, Sungjoo Yoo, Sheayun Lee, Sangwoo Lee, Hye Jeong Nam, Bum-Seok Yoo, Jaehyung Hwang, Donghyun Song, Janghwan Kim, Jeongeun Kim, HoonSang Jin, Kyu-Myung Choi, Jeong-Taek Kong, Soo-Kwan Eo	Creation and utilization of a virtual platform for embedded software optimization: : an industrial case study.	CODES+ISSS	2006	DBLP DOI BibTeX RDF	embedded software optimization, hybrid HDD (hard disk drive), virtual platform (ViP)
14	Feng Chen 0005, Song Jiang 0001, Xiaodong Zhang 0001	SmartSaver: turning flash drive into a disk energy saver for mobile computers.	ISLPED	2006	DBLP DOI BibTeX RDF	flash drive, mobile computer, energy saving, hard disk
14	Changjiu Xian, Yung-Hsiang Lu	Dynamic voltage scaling for multitasking real-time systems with uncertain execution time.	ACM Great Lakes Symposium on VLSI	2006	DBLP DOI BibTeX RDF	probability, dynamic voltage scaling, multitasking, low energy, hard real-time
14	Jimmy Lin, Philip Fei Wu, Dina Demner-Fushman, Eileen G. Abels	Exploring the limits of single-iteration clarification dialogs.	SIGIR	2006	DBLP DOI BibTeX RDF	TREC HARD, intermediated search, interactive retrieval
14	David Zuckerman	Linear degree extractors and the inapproximability of max clique and chromatic number.	STOC	2006	DBLP DOI BibTeX RDF	approximation, NP-hard, clique, extractor, pseudorandom, disperser, chromatic number, explicit construction
14	Dror Weitz	Counting independent sets up to the tree threshold.	STOC	2006	DBLP DOI BibTeX RDF	Glauber dynamics, hard-core model, strong spatial mixing, independent sets, approximate counting
14	Martin Fürer	A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.	LATIN	2006	DBLP DOI BibTeX RDF	exponential time algorithm, NP-hard, Maximum independent set, sparse graph
14	Haifeng Liu 0007, Wee Keong Ng, Ee-Peng Lim	Scheduling Queries to Improve the Freshness of a Website.	World Wide Web	2005	DBLP DOI BibTeX RDF	Internet data management, hard real-time scheduling, query optimization, view maintenance
14	Ya-feng Wu, Yinlong Xu, Guo-Liang Chen 0001	Approximation Algorithms for Steiner Connected Dominating Set.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	Steiner connected dominated set, approximation algorithm, graph algorithm, NP-hard
14	Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo	Order Scheduling in an Environment with Dedicated Resources in Parallel.	J. Sched.	2005	DBLP DOI BibTeX RDF	order scheduling, approximation, NP-hard, Tabu Search, total completion time
14	Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee	Two Variations of the Minimum Steiner Problem.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time
14	Thomas Holenstein	Key agreement from weak bit agreement.	STOC	2005	DBLP DOI BibTeX RDF	hard-core sets, cryptography, key agreement
14	Manuel Gómez, Concha Bielza	Node deletion sequences in influence diagrams using genetic algorithms.	Stat. Comput.	2004	DBLP DOI BibTeX RDF	node deletion sequence, genetic algorithms, statistical analysis, NP-hard problems, influence diagrams, decision-making under uncertainty
14	Paul Pop, Petru Eles, Zebo Peng	Schedulability-Driven Communication Synthesis for Time Triggered Embedded Systems.	Real Time Syst.	2004	DBLP DOI BibTeX RDF	time-triggered protocol, bus access optimization, schedulability analysis, hard real-time systems, distributed embedded systems
14	Aharon Ben-Tal, A. P. Goryashko, E. Guslitzer, Arkadi Nemirovski	Adjustable robust solutions of uncertain linear programs.	Math. Program.	2004	DBLP DOI BibTeX RDF	Uncertain linear programs, conic optimization, NP-hard continuous optimization problems, adjustable robust counterpart, affinely-adjustable robust counterpart, semidefinite programming, robust optimization
14	Guillem Bernat	Response Time Analysis of Asynchronous Real-Time Systems.	Real Time Syst.	2003	DBLP DOI BibTeX RDF	worst-case response time analysis, weakly-hard, real-time systems, schedulability analysis, asynchronous systems, idle time
14	Timothy Mark Pinkston, Ruoming Pang, José Duato	Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	dependable communication, hard link-level flow control, parallel processing, interconnection networks, dynamic reconfiguration, Deadlock-free routing
14	Carla Fredrick	Extreme Programming: Growing a Team Horizontally.	XP/Agile Universe	2003	DBLP DOI BibTeX RDF	hard fast rules, horizontal, Junit tests, shunted tests, persistence requirements, customer team, requirements, refactoring, extreme programming, XP, developers, vertical, stories, velocity, lurk
14	Nicoleta Neagu, Boi Faltings	Soft Interchangeability for Case Adaptation.	ICCBR	2003	DBLP DOI BibTeX RDF	case adaptation, hard/soft constraint satisfaction problems, substitutability, interchangeability
14	Xiao Hu, Sindhura Bandhakavi, ChengXiang Zhai	Error analysis of difficult TREC topics.	SIGIR	2003	DBLP DOI BibTeX RDF	hard topics, sub-collection, measures, error analysis, dominance, distraction
14	Joseph Douglas Horton, Alejandro López-Ortiz	On the number of distributed measurement points for network tomography.	Internet Measurement Conference	2003	DBLP DOI BibTeX RDF	internet tomography, resilient overlay networks, approximation algorithms, NP-hard, network measurements, topology discovery
14	Javier Miranda, Michael González Harbour	A Proposal to Integrate the POSIX Execution-Time Clocks into Ada 95.	Ada-Europe	2003	DBLP DOI BibTeX RDF	Scheduling, Execution-Time, Ada 95, Hard Real-Time, GNAT
14	Li Chen 0002, Paul P. Wang	Fuzzy relation equations (I): the general and specialized solving algorithms.	Soft Comput.	2002	DBLP DOI BibTeX RDF	Polynomial time problem, N P -hard problem, Algorithm, Fuzzy relation equation
14	Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap	Pseudo approximation algorithms, with applications to optimal motion planning.	SCG	2002	DBLP DOI BibTeX RDF	d 1-optimal motion, optimal motion planning, pseudo approximation, approximation algorithms, NP-hard problem, binary search, robot motion planning, Euclidean shortest path
14	Alexander E. Mohr	Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem.	DCC	2002	DBLP DOI BibTeX RDF	multiple choice knapsack problem, MCKP, data compression, NP-complete, NP-hard, quantization, knapsack problem, bit allocation, rate-distortion optimization
14	Jaejin Lee, David A. Padua	Hiding Relaxed Memory Consistency with a Compiler.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	relaxed memory consistency, fence, compiler, synchronization, NP-hard, dominator, Sequential consistency
14	Enrico Vicario	Static Analysis and Dynamic Steering of Time-Dependent Systems.	IEEE Trans. Software Eng.	2001	DBLP DOI BibTeX RDF	Time-dependent systems, timeliness predictability, enumerative static analysis, dynamic task guarantee, quantitative timing estimation, Time Petri Nets, hard real-time systems
14	Dimitrios Koukopoulos, Yannis C. Stamatiou	A compressed-domain watermarking algorithm for mpeg audio layer 3.	MM&Sec	2001	DBLP DOI BibTeX RDF	hard instances, mpeg audio layer 3, threshold phenomena, NP-completeness, audio watermarking
14	Tao Jiang 0001, Guohui Lin, Bin Ma 0002, Kaizhong Zhang	The Longest Common Subsequence Problem for Arc-Annotated Sequences.	CPM	2000	DBLP DOI BibTeX RDF	Sequence annotation, approximation algorithm, dynamic programming, longest common subsequence, maximum independent set, MAX SNP-hard
14	Wen-Jer Wu, Chuan Yi Tang	Memory test time reduction by interconnecting test items.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	memory test time reduction, test items interconnection, initialization sequences, verification sequences, signal settling time, interconnection problem, rural Chinese postman problem, integer linear programming model, successive ILP models, graph theory, constraints, linear programming, integrated circuit testing, integer programming, iterations, NP-hard problem, integrated memory circuits
14	Andrés Terrasa, Ana García-Fornes, Vicente J. Botti	Including user-defined timing exception support in FRTL.	RTCSA	2000	DBLP DOI BibTeX RDF	user-defined timing exception support, FRTL, flexible hard real-time systems, task deadlines, Flexible Real-Time Linux, CPU consumption, real-time systems, Unix, exception handling, worst-case execution time, operating systems (computers), run-time system, feasibility test
14	Yu-Sheng Huang, Chih-wen Hsueh	Minimizing the maximum end-to-end delay on tree structure using the distributed pinwheel model.	RTCSA	2000	DBLP DOI BibTeX RDF	maximum end-to-end delay minimisation, distributed pinwheel model, end-to-end timing requirements, tight maximum delay bound, quality of service, Internet, computational complexity, timing, computer networks, heuristic algorithm, processor scheduling, timing constraints, simulation result, distributed real-time systems, tree structure, heuristic programming, NP-hard problems, linear-time algorithm, pipeline structure
14	Joël Goossens, Sanjoy K. Baruah	Multiprocessor algorithms for uniprocessor feasibility analysis.	RTCSA	2000	DBLP DOI BibTeX RDF	multiprocessor algorithms, uniprocessor feasibility analysis, uniprocessor real-time systems, asynchronous periodic tasks, preemptive earliest deadline first scheduling, scheduling, real-time systems, parallel algorithms, parallel algorithm, multiprocessing systems, parallel machines, parallel machines, task models, scheduling algorithms, deadlines, hard real-time system
14	Alexander Münnich	PRED-DF - a data flow based semantic concurrency control protocol for real-time main-memory database systems.	RTCSA	2000	DBLP DOI BibTeX RDF	PRED-DF semantic concurrency control protocol, predeclaration, real-time main-memory database systems, locking-based protocol, serializable schedule generation, blocking time minimization, predictable behaviour, real-time requirements verification, scheduling, real-time systems, predictability, concurrency control, database management systems, task scheduling, data flow analysis, data flow analysis, deadlines, access protocols, hard real-time systems, safety-critical software, safety-critical applications, verification methods
14	Stefan M. Petters	Bounding the execution time of real-time tasks on modern processors.	RTCSA	2000	DBLP DOI BibTeX RDF	task execution time, modern processors, embedded hard real time systems, up-to-date processors, fast core frequency, systematic information, real-time systems, computer architecture, complex systems, control flow graph, main memory, flow graphs, optimising compilers, real time tasks, acceleration techniques
14	Dong-Hwan Park, Soon-Ju Kang	IEEE1394 OHCI device driver architecture for guarantee real-time requirement.	RTCSA	2000	DBLP DOI BibTeX RDF	IEEE1394 OHCI device driver architecture, guaranteed real time requirement, priority based packet queueing, interrupt latency time, ISR, Interrupt Service Routine, device driver level support, real time characteristics, high priority applications, digital multimedia services, hard real time instrumentation, control applications, real-time systems, queueing theory, packet switching, interrupts, client-server systems, home networks, device drivers, QoS guarantees, real time requirements, real time middleware
14	Kristian Sandström, Christer Norström, Magnus Ahlmark	Frame packing in real-time communication.	RTCSA	2000	DBLP DOI BibTeX RDF	frame packing, common computational model, signal exchange, physical device, signal size, deadline requirement, broadcast bus, variable sized frames, resource perspective, periodic frames, network bandwidth requirement, simple heuristics, signal sets, CAN based system, Local Interconnect Network, cost sensitive embedded systems, car control systems, real-time systems, computational complexity, distributed processing, NP-hard, communication networks, bandwidth allocation, real time communication, microcontrollers, microcontrollers, controller area networks, distributed embedded systems, objective function, automobiles, automotive applications, production cost
14	Dennis Joshua Chia, Andrew Lim 0001	Local search algorithm for the compacted cells area problem.	ICTAI	2000	DBLP DOI BibTeX RDF	compacted cells area problem, optimal cost, taboo search algorithm, computational complexity, lower-bound, lower bounds, NP-hard, search problems, divide and conquer methods, local search algorithm, polynomial-time solvable, divide-and-conquer approach
14	Philippe Chatalic, Laurent Simon	Multi-resolution on compressed sets of clauses.	ICTAI	2000	DBLP DOI BibTeX RDF	compressed sets, compressed clauses, propositional clauses, compression power, structured instances, specialized operator, clause sets, polynomial size data structures, ZREs system, Davis-Putnam procedure, hard problems, SAT provers, zero-suppressed binary decision diagrams, computational complexity, data structures, data structures, data compression, theorem proving, computability, encodings, directed graphs, binary decision diagrams, set theory, multi-resolution, cut eliminations, ZBDDs
14	Khaled Saab 0001, Naim Ben-Hamida, Bozena Kaminska	Closing the gap between analog and digital.	DAC	2000	DBLP DOI BibTeX RDF	hard faults, fault modeling, fault simulation, test vector generation
14	Tarek F. Abdelzaher, Kang G. Shin	Combined Task and Message Scheduling in Distributed Real-Time Systems.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	combined task and message scheduling, distributed hard real-time systems, Real-time scheduling, deadlock, resource constraints
14	Ricardo C. Corrêa, Afonso Ferreira, Pascal Rebreyend	Scheduling Multiprocessor Tasks with Genetic Algorithms.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	list heuristics for scheduling problems, genetic algorithms, optimization, Multiprocessors, NP-hard, scheduling problems
14	Philip L. Worthington, Edwin R. Hancock	New Constraints on Data-Closeness and Needle Map Consistency for Shape-from-Shading.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	hard constraints, curvature consistency, gradient consistency, Shape-from-shading, robust statistics
14	Andrew Way, Ian Crookston, Jane Shelton	A Typology of Translation Problems for Eurotra Translation Machines.	Mach. Transl.	1997	DBLP DOI BibTeX RDF	Hard translation problems, Eurotra, translation notations
14	Muhammad Kafil, Ishfaq Ahmad	Optimal task assignment in heterogeneous computing systems.	Heterogeneous Computing Workshop	1997	DBLP DOI BibTeX RDF	optimal task assignment, best-first search technique, assignment algorithm, distributed systems, computational complexity, artificial intelligence, high-performance computing, NP-hard, time complexity, clustering technique, search technique, heuristic techniques, heterogeneous computing systems
14	Mauricio Marín	Billiards and Related Systems on the Bulk-Synchronous Parallel Model.	Workshop on Parallel and Distributed Simulation	1997	DBLP DOI BibTeX RDF	billiards, bulk-synchronous parallel model, colliding hard-spheres, homogeneous large-scale systems, ising-spin models, discrete event simulation, discrete-event simulation, scalable computation, general purpose parallel computing
14	Joseph Kee-Yin Ng, Shibin Song, Wei Zhao 0001	Integrated delay analysis of regulated ATM switch.	RTSS	1997	DBLP DOI BibTeX RDF	integrated delay analysis, regulated ATM switch, worst case delay, hard real-time connection, real-time connection traffic, arrival functions, priority driven scheduling, FIFO scheduling, admission probability, cell delay estimation, performance, asynchronous transfer mode, deadline, simulation experiments, service functions, piecewise linear functions
14	Andreas Ermedahl, Hans Hansson, Mikael Sjödin	Response-time guarantees in ATM networks.	RTSS	1997	DBLP DOI BibTeX RDF	response time guarantees, traditional real time CPU Response Time Analysis, hard real time traffic, strict timing requirements, Calculus for Network Delays, traffic scenarios, observed worst case behaviors, CND, realistic traffic scenarios, asynchronous transfer mode, Asynchronous Transfer Mode, admission control, ATM networks, Weighted Fair Queuing, WFQ
14	Manas Saksena, Paul Freedman, Pawel Rodziewicz	Guidelines for automated implementation of executable object oriented models for real-time embedded control systems.	RTSS	1997	DBLP DOI BibTeX RDF	control system analysis computing, automated implementation, executable object oriented models, real time embedded control systems, real time scheduling theory, ROOM methodology, telecommunications community, commercial systems, case tool ObjecTime, reactive real time behavior, hard real time components, cruise control example, ROOM model, executable models, priority inversions, temporal behavior, Real time Object Oriented Modeling
14	Teik Guan Tan, Wynne Hsu	Scheduling multimedia applications under overload and non-deterministic conditions.	IEEE Real Time Technology and Applications Symposium	1997	DBLP DOI BibTeX RDF	nondeterministic conditions, overload conditions, deterministic techniques, hard real-time scheduling, representative task model, frequency parameter, worst case CPU bounds, best-effort frequency-based scheduling, real-time systems, multimedia applications
14	Albrecht P. Stroele, Frank Mayer	Methods to reduce test application time for accumulator-based self-test.	VTS	1997	DBLP DOI BibTeX RDF	accumulator-based self-test, test length minimization, simulation-based reseeding method, random pattern testable circuits, reverse order simulation, hard fault detection, optimal input value, test length reductions, data path blocks, BIST scheme, ATALANTA fault simulation, combinatorial circuit testing, built-in self test, fault coverage, embedded processor, test pattern generators, circuit optimization, test application time reduction, forward simulation
14	David B. Stewart, Pradeep K. Khosla	Policy-independent real-time operating system mechanisms for timing error detection, handling and monitoring.	HASE	1996	DBLP DOI BibTeX RDF	supervisory programs, policy independent real time operating system mechanisms, timing error detection, estimated worst case execution times, missed deadline, policy independent mechanisms, real time task monitoring, reschedule operation, monitoring mechanism, 6 ms, 1 Kbyte, hard real time systems, scheduling policies, context switch, error handling
14	Chunho Lee, Miodrag Potkonjak, Wayne H. Wolf	System-Level Synthesis of Application Specific Systems using A* Search and Generalized Force-Directed Heuristics.	ISSS	1996	DBLP DOI BibTeX RDF	Hard Real-Time, Search Techniques, System-Level Synthesis
14	Neil C. Audsley, I. J. Bate, Alan Burns 0001	Putting fixed priority scheduling theory into engineering practice for safety critical applications.	IEEE Real Time Technology and Applications Symposium	1996	DBLP DOI BibTeX RDF	aircraft computers, engineering practice, industrial safety-critical hard real-time systems, class A systems, civil aircraft software standard DO178B, evidence gathering, technical benefits, evidence presentation, scheduling, real-time systems, timing, certification, safety-critical software, fixed-priority scheduling, aerospace computing, certification authorities, software standards, timing requirements
14	Eric Bach 0001, Anne Condon, Elton Glaser, Celena Tanguay	DNA Models and Algorithms for NP-complete Problems.	CCC	1996	DBLP DOI BibTeX RDF	3Sat, 3-Coloring, Independent Set problem, DNA algorithms, genetic algorithms, computational complexity, search problems, DNA computing, DNA computation, NP-complete problems, search algorithms, NP-hard problems
14	Dieter van Melkebeek	Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L.	CCC	1996	DBLP DOI BibTeX RDF	computational complexity theory, sparse hard set problem for P
14	Abu Khari bin A'Ain, A. H. Bratt, A. P. Dorey	On the development of power supply voltage control testing technique for analogue circuits.	Asian Test Symposium	1995	DBLP DOI BibTeX RDF	power supply circuits, voltage control, power supply voltage control testing, hard defects, soft defects, simulation, fault diagnosis, integrated circuit testing, data analysis, data analysis, circuit analysis computing, operational amplifiers, operational amplifier, analogue integrated circuits, IC tests, analogue circuits
14	Rainer Leupers, Peter Marwedel	Time-constrained code compaction for DSPs.	ISSS	1995	DBLP DOI BibTeX RDF	code generation techniques, digital signal processing algorithms, encoding restrictions, exact timing behavior, hard real-time constraints, integer programming model, local code compaction, programmable DSP, rigid heuristics, time-constrained code compaction, real-time systems, timing, integer programming, instruction-level parallelism, source coding, automatic programming, digital signal processing chips, side-effects