Search results for "NP-hard"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
11	Ramesh Krishnamurti	An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	parameter dependent bound, asymptotically tight bound, partition sizes, partitionable multiprocessor systems, multiple partitions, minimum completion time schedule, worst-case performance bound, scheduling, parallel algorithms, computational complexity, approximation algorithm, parallelization, controller, multiprocessing systems, NP-hard, task scheduling, polynomial time algorithm, processors, multiprocessing programs
11	Nen-Fu Huang	On the Complexity of Two Circle Strongly Connecting Problems.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	circle strongly connecting problems, demand points, directed edge, computational complexity, approximation algorithm, complexity, computational geometry, NP-hard, directed graphs, digraph, plane, radius
11	Dilip D. Kandlur, Kang G. Shin	Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	virtual cut-through capability, route selection problem, link cost function, C-wrapped hexagonal mesh, performance, computational complexity, hypercube, computer networks, NP-hard, hypercube networks, telecommunication network routing, interprocess communication, minimisation of switching nets, multicomputer networks, minimization problem, traffic routing, network load
11	Sivan Toledo	Maximizing Non-Linear Concave Functions in Fixed Dimension	FOCS	1992	DBLP DOI BibTeX RDF	parametric Euclidean traveling salesman problem, fixed dimension, piece wise polynomial concave function, concave polynomial, input point, nonlinear parametric problems, parametric max flow problem, parametric minimum s-t distance, parametric spanning tree, NP-hard problems, convex set, arithmetic operations, polynomial functions
11	Sanjeev Arora, Carsten Lund, Rajeev Motwani 0001, Madhu Sudan 0001, Mario Szegedy	Proof Verification and Hardness of Approximation Problems	FOCS	1992	DBLP DOI BibTeX RDF	approximation problems, polynomial-time probabilistic oracle machine, random bits, MAXSNP-hard, metric TSP, time complexity, NP, MAX-CUT, MAX-SAT, proof verification
11	Susan B. Davidson, Insup Lee 0001, Victor Fay Wolfe	Timed Atomic Commitment.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	centralized protocols, hard-real-time control, distributed nodes, timed atomic commitment, exceptional state, decentralized protocols, coordinating robots, distributed processing, concurrency control, timing constraints, programming constructs, operating environment, concurrent execution
11	Ding-Zhu Du, Yanjun Zhang, Qing Feng	On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	polynomial-time heuristic, Euclidean Steiner minimum trees, shortest network, NP-hard
11	Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou	How to Learn an Unknown Environment (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	polygonal room, unknown environment, bounded ratio, worst-case distance, offline problem, general obstacle courses, learning, NP-hard, competitive algorithm
11	Sumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa	Crossing Minimization in Linear Embeddings of Graphs.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	crossing minimisation, linear embeddings of graphs, circuit layout problems, computational complexity, graph theory, NP-hard, circuit layout CAD, minimisation
11	Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann 0001, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger	Drawing Graphs in the Plane with High Resolution	FOCS	1990	DBLP DOI BibTeX RDF	high resolution planar graph drawing, straight line edges, minimum angle, incident edges, maximum node degree, hypercubes, NP-hard problem, counting, complete graphs, tori, multidimensional meshes
11	John H. Reif, J. D. Tygar, Akitoshi Yoshida	The Computability and Complexity of Optical Beam Tracing	FOCS	1990	DBLP DOI BibTeX RDF	optical models, refractive surfaces, undecidable problem, PSPACE-hard problem, optical beam tracing, ray-tracing problem, reflective surfaces, incident angle, complexity, computability
11	Arif Ghafoor, Patrick Solé	Performance of Fault-Tolerant Diagnostics in the Hypercube Systems.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	fault-tolerant diagnostics, self-diagnostic algorithm, diagnostic scheme, performance evaluation, performance evaluation, distributed systems, complexity, fault tolerant computing, multiprocessing systems, optimal algorithm, NP-hard problems, coding theory, Hadamard matrix, hypercube systems, combinatorial structure
11	Xian-He Sun, Nabil Kamel, Lionel M. Ni	Processing Implication on Queries.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	Derivability Problem, project-select-joint queries, satisfiabilitya, Database, NP-hard, Directed Graph, Mathematical Logic, Implication Problem
11	Greg N. Frederickson, D. J. Guan	Ensemble Motion Planning in Trees	FOCS	1989	DBLP DOI BibTeX RDF	ensemble motion planning, unit capacity vehicle, minimum cost transportation, nontrivial connected components, initial vertex, route, approximation algorithms, trees, NP-hard, directed graph, objects, edges, vertices, destination, performance ratio
11	Olivier Goldschmidt, Dorit S. Hochbaum	Polynomial Algorithm for the k-Cut Problem	FOCS	1988	DBLP DOI BibTeX RDF	k-cut problem, edge weighted graph, k nonempty components, total edge weight, partition, NP-complete, NP hard, polynomial algorithm, vertex
11	David Hung-Chang Du, Lee-Chin Hsu Liu	Heuristic Algorithms for Single Row Routing.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	printed circuit board routing, NP-hard, Heuristic algorithms, single row routing
11	Che-Liang Yang, Gerald M. Masson	A New Measure for Hybrid Fault Diagnosability.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	test assignment, hard faults, hybrid faults, Fault diagnosis, PMC models, syndrome, soft faults
11	C. Mani Krishna 0001, Kang G. Shin	On Scheduling Tasks with a Quick Recovery from Failure.	IEEE Trans. Computers	1986	DBLP DOI BibTeX RDF	notification times, Fault-tolerant and real-time multiprocessors, hard deadlines, primary and contingency schedules, primary and ghost clones
11	Benjamin W. Wah, Y. W. Eva Ma	MANIP - A Multicomputer Architecture for Solving Combinatorial Extremum-Search Problems.	IEEE Trans. Computers	1984	DBLP DOI BibTeX RDF	Approximate branch-and-bound, parallel branch-and-bound, vertex-covering problem, selection, virtual memory, NP-hard problems, ring network
11	Nicholas J. Giordano, Marvin S. Schwarz	Data Base Recovery at CMIC.	SIGMOD Conference	1976	DBLP DOI BibTeX RDF	hot start, Leaf-First Rule, VSAM, data base recovery, hard crash, on-line data base, program restart, reload and restore, soft crash, track splitting, transaction, B-tree, audit trail
11	Linwei Niu	Energy-aware dual-mode voltage scaling for weakly hard real-time systems.	SAC	2010	DBLP DOI BibTeX RDF	dual priority scheduling, dual-mode voltage scaling, QoS
11	Filip Pizlo, Lukasz Ziarek, Ethan Blanton, Petr Maj, Jan Vitek	High-level programming of embedded hard real-time devices.	EuroSys	2010	DBLP DOI BibTeX RDF	real-time systems, memory management, java virtual machine
11		Hard Disk.	Encyclopedia of Database Systems	2009	DBLP DOI BibTeX RDF
11	Edward T.-H. Chu, Tai-Yi Huang, Cheng-Han Tsai, Jian-Jia Chen, Tei-Wei Kuo	A DVS-assisted hard real-time I/O device scheduling algorithm.	Real Time Syst.	2009	DBLP DOI BibTeX RDF	Dynamic voltage scaling, Dynamic power management, Real-time embedded systems
11	Romeo Rizzi	Minimum Weakly Fundamental Cycle Bases Are Hard To Find.	Algorithmica	2009	DBLP DOI BibTeX RDF	Minimum cycle basis problem, Weakly fundamental cycle basis, Fundamental cycle basis, Computational complexity, Approximation algorithm, Combinatorial optimization, Graphs
11	Meikang Qiu, Edwin Hsing-Mean Sha	Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems.	ACM Trans. Design Autom. Electr. Syst.	2009	DBLP DOI BibTeX RDF	Embedded Systems, real-time, high-level synthesis, heterogeneous
11	Elad Hazan, Robert Krauthgamer	How hard is it to approximate the best Nash equilibrium?	SODA	2009	DBLP DOI BibTeX RDF
11	Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan	The Planar k-Means Problem is NP-Hard.	WALCOM	2009	DBLP DOI BibTeX RDF
11	Andrea Francke, Michael Hoffmann 0001	The Euclidean degree-4 minimum spanning tree problem is NP-hard.	SCG	2009	DBLP DOI BibTeX RDF	degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs
11	Vlado Keselj, Haibin Liu, Norbert Zeh, Christian Blouin, Chris Whidden	Finding optimal parameters for edit distance based sequence classification is NP-hard.	KDD Workshop on Statistical and Relational Learning in Bioinformatics	2009	DBLP DOI BibTeX RDF
11	José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Peter Ross, Jorge Iván Fuentes-Rosado, Manuel Valenzuela-Rendón	A neuro-evolutionary approach to produce general hyper-heuristics for the dynamic variable ordering in hard binary constraint satisfaction problems.	GECCO	2009	DBLP DOI BibTeX RDF	neuro-evolutionary computation, optimization, constraint satisfaction, hyper-heuristics
11	Jiong Guo, Hannes Moser, Rolf Niedermeier	Iterative Compression for Exactly Solving NP-Hard Minimization Problems.	Algorithmics of Large and Complex Networks	2009	DBLP DOI BibTeX RDF
11	Benny Applebaum, David Cash, Chris Peikert, Amit Sahai	Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.	CRYPTO	2009	DBLP DOI BibTeX RDF	Key-dependent message security, Learning problems, Encryption, Lattice-based cryptography
11	Luca Pulina, Armando Tacchella	Hard QBF Encodings Made Easy: Dream or Reality?	AI*IA	2009	DBLP DOI BibTeX RDF
11	Tongquan Wei, Piyush Mishra, Kaijie Wu 0001, Han Liang	Fixed-Priority Allocation and Scheduling for Energy-Efficient Fault Tolerance in Hard Real-Time Multiprocessor Systems.	IEEE Trans. Parallel Distributed Syst.	2008	DBLP DOI BibTeX RDF
11	Parthasarathy Guturu, Ram Dantu	An Impatient Evolutionary Algorithm With Probabilistic Tabu Search for Unified Solution of Some NP-Hard Problems in Graph and Set Theory via Clique Finding.	IEEE Trans. Syst. Man Cybern. Part B	2008	DBLP DOI BibTeX RDF
11	Wolfgang Mulzer, Günter Rote	Minimum-weight triangulation is NP-hard.	J. ACM	2008	DBLP DOI BibTeX RDF	Optimal triangulations, PLANAR 1-IN-3-SAT
11	Gong Chen, Liu Qi, Huijuan Cui, Kun Tang	Switch-Type Hybrid Hard Decision Decoding Algorithms for Regular Low-Density Parity-Check Codes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
11	Tong-Yee Lee, Shao-Wei Yen, I-Cheng Yeh 0001	Texture Mapping with Hard Constraints Using Warping Scheme.	IEEE Trans. Vis. Comput. Graph.	2008	DBLP DOI BibTeX RDF
11	Liefeng Bo, Ling Wang 0003, Licheng Jiao	Training Hard-Margin Support Vector Machines Using Greedy Stagewise Algorithm.	IEEE Trans. Neural Networks	2008	DBLP DOI BibTeX RDF
11	Qingshan Liu 0002, Jun Wang 0002	A One-Layer Recurrent Neural Network With a Discontinuous Hard-Limiting Activation Function for Quadratic Programming.	IEEE Trans. Neural Networks	2008	DBLP DOI BibTeX RDF
11	Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant	Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints.	CPAIOR	2008	DBLP DOI BibTeX RDF
11	Arezou Mohammadi, Selim G. Akl, Firouz Behnamfar	QoS-based optimal logarithmic-time uplink scheduling algorithm for packets with hard or soft deadlines in WiMAX.	PIMRC	2008	DBLP DOI BibTeX RDF
11	Johannes Buchmann 0001, Richard Lindner, Markus Rückert	Explicit Hard Instances of the Shortest Vector Problem.	PQCrypto	2008	DBLP DOI BibTeX RDF	challenge, Lattice reduction, lattice-based cryptography
11	Youngwoo Ahn, Riccardo Bettati	Transient Overclocking for Aperiodic Task Execution in Hard Real-Time Systems.	ECRTS	2008	DBLP DOI BibTeX RDF
11	Fabiano Cruz, Raimundo S. Barreto, Lucas C. Cordeiro, Paulo Romero Martins Maciel	ezRealtime: A Domain-Specific Modeling Tool for Embedded Hard Real-Time Software Synthesis.	DATE	2008	DBLP DOI BibTeX RDF
11	Oriana Ponta, Falk Hüffner, Rolf Niedermeier	Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.	TAMC	2008	DBLP DOI BibTeX RDF
11	Jonathan Barre, Christine Rochange, Pascal Sainrat	A Predictable Simultaneous Multithreading Scheme for Hard Real-Time.	ARCS	2008	DBLP DOI BibTeX RDF
11	Darius Blasband	Hard Facts vs Soft Facts.	WCRE	2008	DBLP DOI BibTeX RDF
11	Alexander Perekrestenko	Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard.	LATA	2008	DBLP DOI BibTeX RDF
11	Craig S. Wright, Dave Kleiman, Shyaam Sundhar R. S.	Overwriting Hard Drive Data: The Great Wiping Controversy.	ICISS	2008	DBLP DOI BibTeX RDF	Data Wipe, Secure Wipe, Digital Forensics, Format
11	Juan Luis Jiménez Laredo, A. E. Eiben, Maarten van Steen, Pedro A. Castillo, Antonio Miguel Mora, Juan Julián Merelo Guervós	P2P Evolutionary Algorithms: A Suitable Approach for Tackling Large Instances in Hard Optimization Problems.	Euro-Par	2008	DBLP DOI BibTeX RDF
11	Amparo Albalate, David Suendermann	Hard vs. Fuzzy Clustering for Speech Utterance Categorization.	PIT	2008	DBLP DOI BibTeX RDF
11	Magnus Jonsson, Kristina Kunert	Reliable hard real-time communication in industrial and embedded systems.	SIES	2008	DBLP DOI BibTeX RDF
11	Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz	A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors.	SAT	2008	DBLP DOI BibTeX RDF
11	Panagiotis Petrantonakis, Vasiliki Kosmidou, Magda Nikolaraizi, Sofia Koutsogiorgou, Leontios J. Hadjileontiadis	"SEE and SEE": An Educational Tool for Kids with Hard of Hearing.	ICALT	2008	DBLP DOI BibTeX RDF
11	Elie Bursztein	Probabilistic Identification for Hard to Classify Protocol.	WISTP	2008	DBLP DOI BibTeX RDF	payload analysis, header discriminator, p2p, traffic classification
11	Thomas Bøgholm, Henrik Kragh-Hansen, Petur Olsen, Bent Thomsen, Kim Guldstrand Larsen	Model-based schedulability analysis of safety critical hard real-time Java programs.	JTRES	2008	DBLP DOI BibTeX RDF	real-time systems, model checking, schedulability analysis, software verification, real-time Java, Java processor
11	Santiago Urueña, Juan Zamorano, José Antonio Pulido, Juan Antonio de la Puente	Communication Paradigms for High-Integrity Distributed Systems with Hard Real-Time Requirements.	DIPES	2008	DBLP DOI BibTeX RDF
11	Bin Chen, Guangri Quan	NP-Hard Problems of Learning from Examples.	FSKD (2)	2008	DBLP DOI BibTeX RDF
11	Gang Zeng, Hiroyuki Tomiyama, Hiroaki Takada, Tohru Ishihara	A Generalized Framework for System-Wide Energy Savings in Hard Real-Time Embedded Systems.	EUC (1)	2008	DBLP DOI BibTeX RDF
11	Paul F. Farrell Jr., Simson L. Garfinkel, Douglas White	Practical Applications of Bloom Filters to the NIST RDS and Hard Drive Triage.	ACSAC	2008	DBLP DOI BibTeX RDF
11	Man-Lap Li, Pradeep Ramachandran, Swarup Kumar Sahoo, Sarita V. Adve, Vikram S. Adve, Yuanyuan Zhou	Understanding the propagation of hard errors to software and implications for resilient system design.	ASPLOS	2008	DBLP DOI BibTeX RDF	architecture, error detection, fault injection, permanent fault
11	Nasser Mohamad Zadeh, Ramin Amirifar	H and Mixed H2/H Control of Dual-Actuator Hard Disk Drive via LMIs.	RAM	2008	DBLP DOI BibTeX RDF
11	Dario Catalano, David Pointcheval, Thomas Pornin	Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication.	J. Cryptol.	2007	DBLP DOI BibTeX RDF
11	Gregorio Malajovich, Klaus Meer	Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
11	Amitkumar Mahadevan, Joel M. Morris	SNR-Invariant Importance Sampling for Hard-Decision Decoding Performance of Linear Block Codes.	IEEE Trans. Commun.	2007	DBLP DOI BibTeX RDF
11	Jon G. Elerath	Hard Disk Drives: The Good, the Bad and the Ugly!	ACM Queue	2007	DBLP DOI BibTeX RDF
11	David Nistér, Fredrik Kahl, Henrik Stewénius	Structure from Motion with Missing Data is NP-Hard.	ICCV	2007	DBLP DOI BibTeX RDF
11	Moumen T. El-Melegy, Ennumeri A. Zanaty, Walaa M. Abd-Elhafiez, Aly A. Farag	On Cluster Validity Indexes in Fuzzy and Hard Clustering Algorithms for Image Segmentation.	ICIP (6)	2007	DBLP DOI BibTeX RDF
11	Ulrich Kühn 0001, Marcel Selhorst, Christian Stüble	Realizing property-based attestation and sealing with commonly available hard- and software.	STC	2007	DBLP DOI BibTeX RDF	property-based attestation, property-based sealing, trusted computing
11	Ewoud Frank van West, Akio Yamamoto, Toshiro Higuchi	Pick and Place of Hard Disk Media using Electrostatic Levitation.	ICRA	2007	DBLP DOI BibTeX RDF
11	Patrick Meumeu Yomsi, Yves Sorel	Extending Rate Monotonic Analysis with Exact Cost of Preemptions for Hard Real-Time Systems.	ECRTS	2007	DBLP DOI BibTeX RDF
11	Ewoud Frank van West, Akio Yamamoto, Benjamin Burns, Toshiro Higuchi	Non-contact handling of hard-disk media by human operator using electrostatic levitation and haptic Device.	IROS	2007	DBLP DOI BibTeX RDF
11	Young-Jin Kim 0002, Kwon-Taek Kwon, Jihong Kim 0001	Energy-efficient disk replacement and file placement techniques for mobile systems with hard disks.	SAC	2007	DBLP DOI BibTeX RDF	disk replacement, file placement, mobile systems, energy saving, multiple disks
11	Florian Dittmann 0001, Stefan Frank	Hard real-time reconfiguration port scheduling.	DATE	2007	DBLP DOI BibTeX RDF
11	Yukihiro Hamasuna, Yasunori Endo, Yasushi Hasegawa, Sadaaki Miyamoto	Two Clustering Algorithms for Data with Tolerance based on Hard c-Means.	FUZZ-IEEE	2007	DBLP DOI BibTeX RDF
11	Alexey V. Anikeenko, Nikolai N. Medvedev	The Role of Quasi-Regular Tetrahedra in Dense Disordered Packings of Hard Spheres.	ISVD	2007	DBLP DOI BibTeX RDF
11	Yi Hu, Ruzhan Lu, Yuquan Chen, Hui Liu 0002, Dongyi Zhang	The Dictionary-Based Quantified Conceptual Relations for Hard and Soft Chinese Text Clustering.	NLDB	2007	DBLP DOI BibTeX RDF
11	Bu-Ching Lin, Geeng-Wei Lee, Juinn-Dar Huang, Jing-Yang Jou	A Precise Bandwidth Control Arbitration Algorithm for Hard Real-Time SoC Buses.	ASP-DAC	2007	DBLP DOI BibTeX RDF
11	Jiong Guo, Rolf Niedermeier	Linear Problem Kernels for NP-Hard Problems on Planar Graphs.	ICALP	2007	DBLP DOI BibTeX RDF
11	Vladimiro Vacca, Francesco Vasca, Luigi Iannelli	Rate Admission Control for Hard Real-Time Task Scheduling.	HSCC	2007	DBLP DOI BibTeX RDF
11	Luis Rademacher	Approximating the centroid is hard.	SCG	2007	DBLP DOI BibTeX RDF	approximation, completeness, centroid, hardness, convex body
11	Navin Kashyap	The "Art of Trellis Decoding" Is NP-Hard.	AAECC	2007	DBLP DOI BibTeX RDF
11	Keith So	Solving hard instances of FPGA routing with a congestion-optimal restrained-norm path search space.	ISPD	2007	DBLP DOI BibTeX RDF	negotiated congestion, routability-driven routing, FPGA
11	Orlando Moreira, Frederico Valente, Marco Bekooij	Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor.	EMSOFT	2007	DBLP DOI BibTeX RDF	scheduling, real-time, dataflow, multi-processor
11	Ricardo Landa Becerra, Carlos A. Coello Coello, Alfredo García Hernández-Díaz, Rafael Caballero 0002, Julián Molina Luque	Alternative techniques to solve hard multi-objective optimization problems.	GECCO	2007	DBLP DOI BibTeX RDF	epsilon-constraint, multi-objective optimization, differential evolution, cultural algorithms
11	Philipp Rohlfshagen, John A. Bullinaria	A genetic algorithm with exon shuffling crossover for hard bin packing problems.	GECCO	2007	DBLP DOI BibTeX RDF	exon shuffling, genetic algorithms, bin packing problem
11	Daniel Tejera, Alejandro Alonso 0001, Miguel A. de Miguel	RMI-HRT: remote method invocation - hard real time.	JTRES	2007	DBLP DOI BibTeX RDF	HRTJ profile, distributed systems, RTSJ, RMI
11	Razib Iqbal, Shervin Shirmohammadi, Jiying Zhao	Hard Authentication of H.264 Video Applying MPEG-21 Generic Bitstream Syntax Description (gBSD).	ICME	2007	DBLP DOI BibTeX RDF
11	Juan Frausto Solís, Alma Nieto-Yáñez	An Improved Simplex-Genetic Method to Solve Hard Linear Programming Problems.	International Conference on Computational Science (4)	2007	DBLP DOI BibTeX RDF	Simplex-Genetic, Genetic algorithm, Linear Programming, Hybrid methods, Simplex method
11	Göran A. V. Christiansson, Erik C. Fritz	A Novel Planar 3-DOF Hard-Soft Haptic Teleoperator.	WHC	2007	DBLP DOI BibTeX RDF
11	Julian J. H. Pontes, Rafael Soares, Ewerson Carvalho, Fernando Moraes 0001, Ney Calazans	SCAFFI: An intrachip FPGA asynchronous interface based on hard macros.	ICCD	2007	DBLP DOI BibTeX RDF
11	Brian Greskamp, Smruti R. Sarangi, Josep Torrellas	Threshold Voltage Variation Effects on Aging-Related Hard Failure Rates.	ISCAS	2007	DBLP DOI BibTeX RDF
11	Theodore P. Baker, Michele Cirinei	Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks.	OPODIS	2007	DBLP DOI BibTeX RDF
11	Aram Galstyan, Paul R. Cohen	Empirical Comparison of "Hard" and "Soft" Label Propagation for Relational Classification.	ILP	2007	DBLP DOI BibTeX RDF
11	Gang Zeng, Hiroyuki Tomiyama, Hiroaki Takada	A Software Framework for Energy and Performance Tradeoff in Fixed-Priority Hard Real-Time Embedded Systems.	EUC	2007	DBLP DOI BibTeX RDF
11	Qingshan Liu 0002, Jun Wang 0002	A One-layer Recurrent Neural Network with a Unipolar Hard-limiting Activation Function for k-Winners-Take-All Operation.	IJCNN	2007	DBLP DOI BibTeX RDF
11	Martin Olsen	Nash Stability in Additively Separable Hedonic Games Is NP-Hard.	CiE	2007	DBLP DOI BibTeX RDF	Nash Stability, Hedonic Games, NP-Completeness
11	Robert W. Irving, David F. Manlove	An 8/5-Approximation Algorithm for a Hard Variant of Stable Marriage.	COCOON	2007	DBLP DOI BibTeX RDF