Search results for "NP-hard"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	Michael Hoffmann 0001, Jayson Lynch, Andrew Winslow	Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.	CoRR	2020	DBLP BibTeX RDF
16	Hong Xuan, Abby Stylianou, Xiaotong Liu, Robert Pless	Hard negative examples are hard, but useful.	CoRR	2020	DBLP BibTeX RDF
16	Rasmus Kyng, Di Wang 0005, Peng Zhang 0052	Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard.	SODA	2020	DBLP DOI BibTeX RDF
16	Hong Xuan, Abby Stylianou, Xiaotong Liu, Robert Pless	Hard Negative Examples are Hard, but Useful.	ECCV (14)	2020	DBLP DOI BibTeX RDF
16	Jan David Smeddinck, Marc Herrlich, Xiaoyi Wang, Guangtao Zhang, Rainer Malaka	Work hard, play hard: How linking rewards in games to prior exercise performance improves motivation and exercise intensity.	Entertain. Comput.	2019	DBLP DOI BibTeX RDF
16	Daniel Prusa, Tomás Werner	Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program.	SIAM J. Optim.	2019	DBLP DOI BibTeX RDF
16	Xiao Wang 0014, Ziliang Chen, Rui Yang, Bin Luo 0001, Jin Tang 0001	Improved Hard Example Mining by Discovering Attribute-based Hard Person Identity.	CoRR	2019	DBLP BibTeX RDF
16	R. Nithyaprakash, Subramaniam Shankar, M. S. Uddin	Computational wear assessment of hard on hard hip implants subject to physically demanding tasks.	Medical Biol. Eng. Comput.	2018	DBLP DOI BibTeX RDF
16	Rajiv Khanna, Anastasios Kyrillidis	IHT dies hard: Provable accelerated Iterative Hard Thresholding.	AISTATS	2018	DBLP BibTeX RDF
16	Rajiv Khanna, Anastasios Kyrillidis	IHT dies hard: Provable accelerated Iterative Hard Thresholding.	CoRR	2017	DBLP BibTeX RDF
16	Daniel Prusa, Tomás Werner	LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP.	SODA	2017	DBLP DOI BibTeX RDF
16	Sakhar B. Alkhereyf, Owen Rambow	Work Hard, Play Hard: Email Classification on the Avocado and Enron Corpora.	TextGraphs@ACL	2017	DBLP DOI BibTeX RDF
16	Martin Frieb, Ralf Jahr, Haluk Ozaktas, Andreas Hugl, Hans Regler, Theo Ungerer	A Parallelization Approach for Hard Real-Time Systems and Its Application on Two Industrial Programs - Strategy and Two Case Studies for the Parallelization of Hard Real-Time Systems.	Int. J. Parallel Program.	2016	DBLP DOI BibTeX RDF
16	Subramaniam Shankar, K. Gowthaman, M. S. Uddin	Predicting long-term wear performance of hard-on-hard bearing couples: effect of cup orientation.	Medical Biol. Eng. Comput.	2016	DBLP DOI BibTeX RDF
16	Kristof Van Beeck	The automatic blind spot camera: hard real-time detection of moving objects from a moving camera ; De automatische dodehoekcamera: hard real-time detectie van bewegende objecten vanaf een bewegende camera.		2016	RDF
16	Mark Boukes, Hajo G. Boomgaarden	Soft News With Hard Consequences? Introducing a Nuanced Measure of Soft Versus Hard News Exposure and Its Relationship With Political Cynicism.	Commun. Res.	2015	DBLP DOI BibTeX RDF
16	Nikolay K. Vereshchagin	Improving on Gutfreund, Shaltiel, and Ta-Shma's Paper "If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances".	CSR	2013	DBLP DOI BibTeX RDF
16	Shlomi Dolev, Nova Fandina, Dan Gutfreund	Succinct Permanent Is NEXP-Hard with Many Hard Instances.	CIAC	2013	DBLP DOI BibTeX RDF
16	Bo Zhao, Yunfei Chen 0001, Roger J. Green	Hard-Input-Hard-Output Capacity Analysis of UWB BPSK Systems With Timing Errors.	IEEE Trans. Veh. Technol.	2012	DBLP DOI BibTeX RDF
16	Shlomi Dolev, Nova Fandina, Dan Gutfreund	Succinct Permanent is NEXP-hard with Many Hard Instances.	Electron. Colloquium Comput. Complex.	2012	DBLP BibTeX RDF
16	Geoff A. Gross, Rakesh Nagi, Kedar Sambhoos, Daniel R. Schlegel, Stuart C. Shapiro, Gregory Tauer	Towards hard+soft data fusion: Processing architecture and implementation for the joint fusion and analysis of hard and soft intelligence data.	FUSION	2012	DBLP BibTeX RDF
16	Nikolay K. Vereshchagin	Improving on Gutfreund, Shaltiel, and Ta-Shma's paper "If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances".	Electron. Colloquium Comput. Complex.	2011	DBLP BibTeX RDF
16	Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita	NP-Hard and k-EXPSPACE-Hard Cast Puzzles.	IEICE Trans. Inf. Syst.	2010	DBLP DOI BibTeX RDF
16	Paul W. Goldberg	How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?	SAGT	2010	DBLP DOI BibTeX RDF
16	Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen	Hard constraint satisfaction problems have hard gaps at location 1.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
16	Darren McCabe	'Hard' is 'soft': exploring the dangers of the 'hard'/'soft' distinction.	Int. J. Inf. Syst. Chang. Manag.	2007	DBLP DOI BibTeX RDF
16	Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen	Hard constraint satisfaction problems have hard gaps at location 1	CoRR	2007	DBLP BibTeX RDF
16	Bruce J. MacLennan	Consciousness in robots: the hard problem and some less hard problems.	RO-MAN	2005	DBLP DOI BibTeX RDF
16	Ke Xu 0001, Wei Li 0022	Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances	CoRR	2003	DBLP BibTeX RDF
16	Daqing He, Dina Demner-Fushman	HARD Experiment at Maryland: From Need Negotiation to Automated HARD Process.	TREC	2003	DBLP BibTeX RDF
16	Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel	Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.	Discret. Appl. Math.	2002	DBLP DOI BibTeX RDF
16	Alex M. Andrew	Cambrian Intelligence: The Early History of the New AI, by Rodney A. Brooks, MIT Press (Bradford), Cambridge, Mass., 1999, xii+199 pp. ISBN (hard cover) 0-262-02468-3, (paperback) 0-262-52263-2 (hard cover, £37.50; paperback £15.50.	Robotica	2000	DBLP DOI BibTeX RDF
16	Fanny Wattez, Sophie Cluet, Véronique Benzaken, Guy Ferran, Christian Fiegel	Benchmarking Queries over Trees: Learning the Hard Truth the Hard Way.	SIGMOD Conference	2000	DBLP DOI BibTeX RDF
16	Marsha L. Selmer	CensusCD+Maps: East Brunswick, NJ: GeoLytics, Inc., c1996-1998. Version 2.0, 1 compact disc + 1 Quick Start Guide, 43 p. $249.95 (upgrade from Version 1.1, $99.95). System requirements: Windows 98, 95, NT, or 3.1x; 386 CPU or better; minimum of 8mb (12mb recommended) RAM installed; single speed CD-ROM drive or faster; 1mb of free hard disk space is required to run from the CD-ROM only mode (the hard disk installation will take up to 4.5mb).	Gov. Inf. Q.	1999	DBLP DOI BibTeX RDF
16	Harry Buhrman, Dieter van Melkebeek	Hard Sets Are Hard to Find.	J. Comput. Syst. Sci.	1999	DBLP DOI BibTeX RDF
16	Ulrich Faigle, Walter Kern, Jeroen Kuipers	Note Computing the nucleolus of min-cost spanning tree games is NP-hard - Computing the nucleolus of min-cost spanning tree games is NP-hard.	Int. J. Game Theory	1998	DBLP DOI BibTeX RDF
16	Harry Buhrman, Dieter van Melkebeek	Hard Sets are Hard to Find.	CCC	1998	DBLP DOI BibTeX RDF
16	Paulo Veríssimo, José Rufino, Li Ming	How Hard is Hard Real-time Communication on Field-Buses?.	FTCS	1997	DBLP DOI BibTeX RDF
16	Laura A. Sanchis	Generating Hard and Diverse Test Sets for NP-hard Graph Problems.	Discret. Appl. Math.	1995	DBLP DOI BibTeX RDF
16	Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith	How hard are n2-hard problems?	SIGACT News	1994	DBLP DOI BibTeX RDF
16	Gürsel Alici, Ron W. Daniel	Static Friction Effects During Hard-on-Hard Contact Tasks and Their Implications for Manipulator Design.	Int. J. Robotics Res.	1994	DBLP DOI BibTeX RDF
16	Xin Yao 0001	Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard.	Inf. Process. Lett.	1992	DBLP DOI BibTeX RDF
16	Ken Tindell, Alan Burns 0001, Andy J. Wellings	Allocating Hard Real-Time tasks: An NP-Hard Problem Made Easy.	Real Time Syst.	1992	DBLP DOI BibTeX RDF
16	Stephen P. Masticola, Thomas J. Marlowe	Static Analysis: Hard Real Time is Hard, "Big Time!".	NATO ASI RTC	1992	DBLP DOI BibTeX RDF
16	MohammadHossein Bateni, MohammadTaghi Hajiaghayi	Assignment problem in content distribution networks: unsplittable hard-capacitated facility location.	SODA	2009	DBLP DOI BibTeX RDF
16	Christoph Dürr, Flavio Guiñez, Martín Matamala	Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard.	ESA	2009	DBLP DOI BibTeX RDF
16	Taekhoon Kim, Dong In Kim	Hybrid Hard/Soft Decode-and-Forward Relaying Protocol with Distributed Turbo Code.	ICCSA (2)	2009	DBLP DOI BibTeX RDF	decode-and-forward (DF), distributed turbo code (DTC), hybrid relaying protocol, Cooperative diversity, relay network
16	Tammar Shrot, Yonatan Aumann, Sarit Kraus	Easy and hard coalition resource game formation problems: a parameterized complexity analysis.	AAMAS (1)	2009	DBLP BibTeX RDF	coalition problems, parameterized complexity
16	Chia-Cheng Hsu, Guu-chang Yang, Wing C. Kwong	Hard-Limiting Performance Analysis of 2-D Optical Codes Under the Chip-Asynchronous Assumption.	IEEE Trans. Commun.	2008	DBLP DOI BibTeX RDF
16	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating All Vertices of a Polyhedron Is Hard.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF
16	Smriti Agrawal, Rama Shankar Yadav, Ranvijay	A Preemption Control Technique for System Energy Minimization of Weakly Hard Real-Time Systems.	Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing	2008	DBLP DOI BibTeX RDF	Dynamic power down, (m, k) model, Scheduling, Dynamic voltage scaling, Portable devices
16	Albert Meixner, Daniel J. Sorin	Detouring: Translating software to circumvent hard faults in simple cores.	DSN	2008	DBLP DOI BibTeX RDF
16	Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zhou	Address-branch correlation: A novel locality for long-latency hard-to-predict branches.	HPCA	2008	DBLP DOI BibTeX RDF
16	Nazli Guney, Hakan Deliç, Fatih Alagöz	Capacity and Mutual Information of Soft and Hard Decision Output M-Ary PPM over UWB Channels.	ICC	2008	DBLP DOI BibTeX RDF
16	Mengqi Zeng, Fangyong Hou, Dawu Gu, Yuanyuan Zhang 0002, NingNan Song	Efficient Authenticated Encryption for Hybrid Hard Drives Based on GCM.	HPCC	2008	DBLP DOI BibTeX RDF
16	Chow Yin Lai, Frank L. Lewis, V. Venkataramanan, Xuemei Ren, Shuzhi Sam Ge, Thomas Liew	Neural networks for disturbance and friction compensation in hard disk drives.	CDC	2008	DBLP DOI BibTeX RDF
16	Daniel Lokshtanov	Wheel-Free Deletion Is W[2]-Hard.	IWPEC	2008	DBLP DOI BibTeX RDF
16	Fernando Esponda, Elena S. Ackley, Paul Helman, Haixia Jia, Stephanie Forrest	Protecting data privacy through hard-to-reverse negative databases.	Int. J. Inf. Sec.	2007	DBLP DOI BibTeX RDF	Negative database, Security, Privacy, Boolean satisfiability, k-SAT
16	Petr Hlinený	Some Hard Problems on Matroid Spikes.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
16	Kay Chen Tan, Ramasubramanian Sathikannan, Woei Wan Tan, A. P. Loh	Evolutionary design and implementation of a hard disk drive servo control system.	Soft Comput.	2007	DBLP DOI BibTeX RDF	Servo systems, Evolutionary algorithms, Intelligent control
16	Andrea Grosso, Marco Locatelli 0001, Fabio Schoen	A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures.	Math. Program.	2007	DBLP DOI BibTeX RDF	Large scale global optimization, Multistart, Basin hopping, Population-based approaches, Molecular conformation problems
16	Chi-Yi Tsai, Kai-Tai Song	Heterogeneity-Projection Hard-Decision Color Interpolation Using Spectral-Spatial Correlation.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
16	Evan Shechter, Arjun Arumbakkam, P. Lamoureux, Xueti Tang, M. Shima, Srinivas Akella	Towards batch fabrication and assembly of 3D microstructures: A sequential assembly planner with new hard magnet configuration.	IROS	2007	DBLP DOI BibTeX RDF
16	Alessandro Di Marco	Exploiting Commodity Hard-Disk Geometry to Efficiently Preserve Data Consistency.	EPEW	2007	DBLP DOI BibTeX RDF	rotational latency reduction, disk characterization, performance, data layout, measurement techniques, disk drives
16	Linwei Niu, Gang Quan	Interactive presentation: Peripheral-conscious scheduling on energy minimization for weakly hard real-time systems.	DATE	2007	DBLP DOI BibTeX RDF
16	Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen	Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems.	CSR	2007	DBLP DOI BibTeX RDF	maximum constraint satisfaction, complexity, approximability
16	Qixin Wang, Xue Liu 0001, Jennifer C. Hou, Lui Sha	GD-Aggregate: A WAN Virtual Topology Building Tool for Hard Real-Time and Embedded Applications.	RTSS	2007	DBLP DOI BibTeX RDF
16	Jian-Guang Luo, Yun Tang, Meng Zhang 0001, Shi-Qiang Yang	Characterizing User Behavior Model to Evaluate Hard Cache in Peer-to-Peer Based Video-on-Demand Service.	MMM (2)	2007	DBLP DOI BibTeX RDF
16	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating all vertices of a polyhedron is hard.	SODA	2006	DBLP DOI BibTeX RDF	enumeration problem, facet enumeration, feasible system, negative cycle, polytope-polyhedron problem, vertex enumeration, graph, cycle, face, polytope, polyhedron, facet, vertex, linear inequalities
16	Bin Ye, Jun Sun 0008, Wenbo Xu 0001	Solving the Hard Knapsack Problems with a Binary Particle Swarm Approach.	ICIC (3)	2006	DBLP DOI BibTeX RDF
16	Holger Giese, Stefan Henkler	Architecture-driven platform independent deterministic replay for distributed hard real-time systems.	ROSATEA	2006	DBLP DOI BibTeX RDF
16	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Clique-width minimization is NP-hard.	STOC	2006	DBLP DOI BibTeX RDF	absolute approximation, NP-completeness, clique-width, pathwidth
16	Loganathan Lingappan, Niraj K. Jha	Improving the Performance of Automatic Sequential Test Generation by Targeting Hard-to-Test Faults.	VLSI Design	2006	DBLP DOI BibTeX RDF
16	Won Eui Hong, Jae Shin Lee, Laxmisha Rai, Soon-Ju Kang	RT-Linux Based Hard Real-Time Software Architecture for Unmanned Autonomous Helicopters.	RTCSA	2005	DBLP DOI BibTeX RDF
16	Tianzhou Chen, Yi Lian, Jiangwei Huang	A New Approach for Predictable Hard Real-Time Transaction Processing in Embedded Database.	ICESS	2004	DBLP DOI BibTeX RDF
16	Petr Hlinený	Crossing Number Is Hard for Cubic Graphs.	MFCS	2004	DBLP DOI BibTeX RDF	NP-completeness, Crossing number, cubic graph
16	Jonathan Rose	Hard vs. Soft: The Central Question of Pre-Fabricated Silicon.	ISMVL	2004	DBLP DOI BibTeX RDF
16	Christian Siemers, Rainer Falsett, Reinhard Seyer, Klaus H. Ecker	Supporting the Hard Real-Time Requirements of Mechatronic Systems by 2-Level Interrupt Service Management.	IPDPS	2003	DBLP DOI BibTeX RDF	Mechatronic System, Event-Triggered System, Interrupt-Request Controller, Event Combining, Schedulability, Rate-Monotonic Analysis
16	Shaoxiong Hua, Gang Qu 0001	A New Quality of Service Metric for Hard/Soft Real-Time Applications.	ITCC	2003	DBLP DOI BibTeX RDF
16	Jinhwan Kim, Namyun Kim, Bonggyou Lee	Adaptive Scheduling Techniques for Multimedia Computing in Hard Real-Time Systems.	DS-RT	2003	DBLP DOI BibTeX RDF
16	Alexander Bauer, Peter Rössler	A Hard Real-Time Bus Arbitration Protocol based on EIA-709.	ECRTS	2002	DBLP DOI BibTeX RDF
16	Ian Broster, Guillem Bernat, Alan Burns 0001	Weakly Hard Real-time Constraints on Controller Area Network.	ECRTS	2002	DBLP DOI BibTeX RDF
16	Tobias Ritzau, Peter Fritzson	Decreasing Memory Overhead in Hard Real-Time Garbage Collection.	EMSOFT	2002	DBLP DOI BibTeX RDF
16	Jonas Holmerin	Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon.	STOC	2002	DBLP DOI BibTeX RDF
16	Jonas Holmerin	Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - ε.	CCC	2002	DBLP DOI BibTeX RDF
16	Guillem Bernat, Alan Burns 0001, Albert Llamosí	Weakly Hard Real-Time Systems.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	Real-time systems, specification, scheduling algorithms, schedulability analysis, temporal constraints, transient overload
16	Eike Kiltz	A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits.	FCT	2001	DBLP DOI BibTeX RDF
16	Victor B. Lortz, Kang G. Shin, Jinho Kim	MDARTS: A Multiprocessor Database Architecture for Hard Real-Time Systems.	IEEE Trans. Knowl. Data Eng.	2000	DBLP DOI BibTeX RDF	exemplar-based programming, atomic data types, concurrency control, shared memory, object-oriented systems, Real-time databases, semantic constraints
16	Milan Zorman, Vili Podgorelec, Peter Kokol, Margaret G. E. Peterson, Joseph M. Lane	Decision Tree's Induction Strategies Evaluated on a Hard Real World Problem.	CBMS	2000	DBLP DOI BibTeX RDF	evolutionary decision trees, orthopaedic fracture data, decision trees, hybrid methods
16	Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim	Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs.	ICALP	1999	DBLP DOI BibTeX RDF
16	Fridtjof Siebert	Hard Real-Time Garbage-Collection in the Jamaica Virtual Machine.	RTCSA	1999	DBLP DOI BibTeX RDF
16	Han Namgoong, Myung-Joon Kim	Improved Hard Acknowledgement Deadline Protocol in Real-Time RPC.	EUROMICRO	1999	DBLP DOI BibTeX RDF
16	Liming Cai, David W. Juedes, Iyad A. Kanj	The Inapproximability of Non NP-hard Optimization Problems.	ISAAC	1998	DBLP DOI BibTeX RDF
16	Axel W. Krings, M. H. Azadmanesh	Resource Reclaiming in Hard Real-Time Systems with Static and Dynamic Workloads.	HICSS (1)	1997	DBLP DOI BibTeX RDF
16	Jongwon Lee, Sungyoung Lee, Hyungill Kim	Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems.	Workshop on Languages, Compilers, & Tools for Real-Time Systems	1995	DBLP DOI BibTeX RDF
16	Ronald V. Book, Osamu Watanabe 0001	On Random Hard Sets for NP.	ISAAC	1994	DBLP DOI BibTeX RDF
16	Bin Fu, Hong-Zhou Li	On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets.	ISAAC	1992	DBLP DOI BibTeX RDF
16	Alan Burns 0001, Andy J. Wellings	Designing Hard Real-Time Systems.	Ada-Europe	1992	DBLP DOI BibTeX RDF
16	Miroslaw Kowaluk, Klaus W. Wagner	Vector Language: Simple Description of Hard Instances (Extended Abstract).	MFCS	1990	DBLP DOI BibTeX RDF
16	Luc Longpré, Alan L. Selman	Hard Promise Problems and Nonuniform Complexity.	STACS	1990	DBLP DOI BibTeX RDF