|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14454 occurrences of 5938 keywords
|
|
|
Results
Found 21153 publication records. Showing 21145 according to the selection in the facets
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.08862, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Hong Xuan, Abby Stylianou, Xiaotong Liu, Robert Pless |
Hard negative examples are hard, but useful. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.12749, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 279-296, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Hong Xuan, Abby Stylianou, Xiaotong Liu, Robert Pless |
Hard Negative Examples are Hard, but Useful. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECCV (14) ![In: Computer Vision - ECCV 2020 - 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XIV, pp. 126-142, 2020, Springer, 978-3-030-58567-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entertain. Comput. ![In: Entertain. Comput. 29, pp. 20-30, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 29(3), pp. 1745-1771, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.02102, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Medical Biol. Eng. Comput. ![In: Medical Biol. Eng. Comput. 56(5), pp. 899-910, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Rajiv Khanna, Anastasios Kyrillidis |
IHT dies hard: Provable accelerated Iterative Hard Thresholding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: International Conference on Artificial Intelligence and Statistics, AISTATS 2018, 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands, Spain, pp. 188-198, 2018, PMLR. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Rajiv Khanna, Anastasios Kyrillidis |
IHT dies hard: Provable accelerated Iterative Hard Thresholding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1712.09379, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
16 | Daniel Prusa, Tomás Werner |
LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 1372-1382, 2017, SIAM, 978-1-61197-478-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
16 | Sakhar B. Alkhereyf, Owen Rambow |
Work Hard, Play Hard: Email Classification on the Avocado and Enron Corpora. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TextGraphs@ACL ![In: Proceedings of TextGraphs@ACL 2017: the 11th Workshop on Graph-based Methods for Natural Language Processing, Vancouver, Canada, August 3, 2017, pp. 57-65, 2017, Association for Computational Linguistics, 978-1-945626-60-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Parallel Program. ![In: Int. J. Parallel Program. 44(6), pp. 1296-1336, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Medical Biol. Eng. Comput. ![In: Medical Biol. Eng. Comput. 54(10), pp. 1541-1552, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. Res. ![In: Commun. Res. 42(5), pp. 701-731, 2015. The full citation details ...](Pics/full.jpeg) |
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". ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings, pp. 203-211, 2013, Springer, 978-3-642-38535-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Shlomi Dolev, Nova Fandina, Dan Gutfreund |
Succinct Permanent Is NEXP-Hard with Many Hard Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, pp. 183-196, 2013, Springer, 978-3-642-38232-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Veh. Technol. ![In: IEEE Trans. Veh. Technol. 61(4), pp. 1741-1751, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Shlomi Dolev, Nova Fandina, Dan Gutfreund |
Succinct Permanent is NEXP-hard with Many Hard Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR12, 2012. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUSION ![In: 15th International Conference on Information Fusion, FUSION 2012, Singapore, July 9-12, 2012, pp. 955-962, 2012, IEEE, 978-0-9824438-5-9. The full citation details ...](Pics/full.jpeg) |
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". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita |
NP-Hard and k-EXPSPACE-Hard Cast Puzzles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 93-D(11), pp. 2995-3004, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Paul W. Goldberg |
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings, pp. 15-17, 2010, Springer, 978-3-642-16169-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen |
Hard constraint satisfaction problems have hard gaps at location 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(38-40), pp. 3856-3874, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Darren McCabe |
'Hard' is 'soft': exploring the dangers of the 'hard'/'soft' distinction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Syst. Chang. Manag. ![In: Int. J. Inf. Syst. Chang. Manag. 2(1), pp. 4-20, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen |
Hard constraint satisfaction problems have hard gaps at location 1 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0712.1532, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
16 | Bruce J. MacLennan |
Consciousness in robots: the hard problem and some less hard problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RO-MAN ![In: IEEE International Workshop on Robot and Human Interactive Communication, RO-MAN 2005, Nashville, TN, USA, 13-15 August, 2005, pp. 434-439, 2005, IEEE, 0-7803-9274-4. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.CC/0302001, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
16 | Daqing He, Dina Demner-Fushman |
HARD Experiment at Maryland: From Need Negotiation to Automated HARD Process. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TREC ![In: Proceedings of The Twelfth Text REtrieval Conference, TREC 2003, Gaithersburg, Maryland, USA, November 18-21, 2003, pp. 707-714, 2003, National Institute of Standards and Technology (NIST). The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 120(1-3), pp. 13-23, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Robotica ![In: Robotica 18(5), pp. 577-578, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18, 2000, Dallas, Texas, USA., pp. 510-511, 2000, ACM, 1-58113-217-4. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Gov. Inf. Q. ![In: Gov. Inf. Q. 16(1), pp. 75-77, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Harry Buhrman, Dieter van Melkebeek |
Hard Sets Are Hard to Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 59(2), pp. 327-345, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Game Theory ![In: Int. J. Game Theory 27(3), pp. 443-450, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Harry Buhrman, Dieter van Melkebeek |
Hard Sets are Hard to Find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 13th Annual IEEE Conference on Computational Complexity, Buffalo, New York, USA, June 15-18, 1998, pp. 170-181, 1998, IEEE Computer Society, 0-8186-8395-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Paulo Veríssimo, José Rufino, Li Ming |
How Hard is Hard Real-time Communication on Field-Buses?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTCS ![In: Digest of Papers: FTCS-27, The Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing, Seattle, Washington, USA, June 24-27, 1997, pp. 112-121, 1997, IEEE Computer Society, 0-8186-7831-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Laura A. Sanchis |
Generating Hard and Diverse Test Sets for NP-hard Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 58(1), pp. 35-66, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith |
How hard are n2-hard problems? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 25(2), pp. 83-85, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Robotics Res. ![In: Int. J. Robotics Res. 13(6), pp. 508-520, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Xin Yao 0001 |
Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 41(2), pp. 93-98, 1992. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 4(2), pp. 145-165, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Stephen P. Masticola, Thomas J. Marlowe |
Static Analysis: Hard Real Time is Hard, "Big Time!". ![Search on Bibsonomy](Pics/bibsonomy.png) |
NATO ASI RTC ![In: Real Time Computing, Proceedings of the NATO Advanced Study Institute on Real Time Computing, held in Sint Maarten, Dutch Antilles, October 5-17, 1992, pp. 702-703, 1992, Springer, 978-3-642-88051-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
16 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi |
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 805-814, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 776-787, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Taekhoon Kim, Dong In Kim |
Hybrid Hard/Soft Decode-and-Forward Relaying Protocol with Distributed Turbo Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2009, International Conference, Seoul, Korea, June 29-July 2, 2009, Proceedings, Part II, pp. 372-382, 2009, Springer, 978-3-642-02456-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS (1) ![In: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 1, pp. 433-440, 2009, IFAAMAS, 978-0-9817381-6-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 56(5), pp. 762-768, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(1-3), pp. 174-190, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing ![In: Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, pp. 201-215, 2008, Springer, 978-3-540-70559-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: The 38th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2008, June 24-27, 2008, Anchorage, Alaska, USA, Proceedings, pp. 80-89, 2008, IEEE Computer Society, 978-1-4244-2397-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCA ![In: 14th International Conference on High-Performance Computer Architecture (HPCA-14 2008), 16-20 February 2008, Salt Lake City, UT, USA, pp. 74-85, 2008, IEEE Computer Society, 978-1-4244-2070-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 4654-4658, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC ![In: 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008, 25-27 Sept. 2008, Dalian, China, pp. 964-970, 2008, IEEE Computer Society, 978-0-7695-3352-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 3640-3645, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Daniel Lokshtanov |
Wheel-Free Deletion Is W[2]-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 141-147, 2008, Springer, 978-3-540-79722-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Sec. ![In: Int. J. Inf. Sec. 6(6), pp. 403-415, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Negative database, Security, Privacy, Boolean satisfiability, k-SAT |
16 | Petr Hlinený |
Some Hard Problems on Matroid Spikes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(3), pp. 551-562, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 11(2), pp. 131-139, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 110(2), pp. 373-404, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 16(1), pp. 78-91, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29 - November 2, 2007, Sheraton Hotel and Marina, San Diego, California, USA, pp. 584-589, 2007, IEEE, 978-1-4244-0912-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Alessandro Di Marco |
Exploiting Commodity Hard-Disk Geometry to Efficiently Preserve Data Consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPEW ![In: Formal Methods and Stochastic Models for Performance Evaluation, Fourth European Performance Engineering Workshop, EPEW 2007, Berlin, Germany, September 27-28, 2007, Proceedings, pp. 260-274, 2007, Springer, 978-3-540-75210-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: 2007 Design, Automation and Test in Europe Conference and Exposition, DATE 2007, Nice, France, April 16-20, 2007, pp. 791-796, 2007, EDA Consortium, San Jose, CA, USA, 978-3-9810801-2-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen |
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 182-193, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 28th IEEE Real-Time Systems Symposium (RTSS 2007), 3-6 December 2007, Tucson, Arizona, USA, pp. 379-388, 2007, IEEE Computer Society, 0-7695-3062-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMM (2) ![In: Advances in Multimedia Modeling, 13th International Multimedia Modeling Conference, MMM 2007, Singapore, January 9-12, 2007. Proceedings, Part II, pp. 125-134, 2007, Springer, 978-3-540-69428-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 758-765, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Computational Intelligence and Bioinformatics, International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. Proceedings, Part III, pp. 155-163, 2006, Springer, 3-540-37277-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Holger Giese, Stefan Henkler |
Architecture-driven platform independent deterministic replay for distributed hard real-time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ROSATEA ![In: Proceedings of the 2006 Workshop on Role of Software Architecture for Testing and Analysis, held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2006), ROSATEA 2006, Portland, Maine, USA, July 17-20, 2006, pp. 28-38, 2006, ACM, 1-59593-459-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Clique-width minimization is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 354-362, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 19th International Conference on VLSI Design (VLSI Design 2006), 3-7 January 2006, Hyderabad, India, pp. 431-436, 2006, IEEE Computer Society, 0-7695-2502-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2005), 17-19 August 2005, Hong Kong, China, pp. 555-558, 2005, IEEE Computer Society, 0-7695-2346-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICESS ![In: Embedded Software and Systems, First International Conference, ICESS 2004, Hangzhou, China, December 9-10, 2004, Revised Selected Papers, pp. 222-228, 2004, Springer, 3-540-28128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Petr Hlinený |
Crossing Number Is Hard for Cubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 772-782, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
NP-completeness, Crossing number, cubic graph |
16 | Jonathan Rose |
Hard vs. Soft: The Central Question of Pre-Fabricated Silicon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 19-22 May 2004, Toronto, Canada, pp. 2-5, 2004, IEEE Computer Society, 0-7695-2130-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 119, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC ![In: 2003 International Symposium on Information Technology (ITCC 2003), 28-30 April 2003, Las Vegas, NV, USA, pp. 347-351, 2003, IEEE Computer Society, 0-7695-1916-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Jinhwan Kim, Namyun Kim, Bonggyou Lee |
Adaptive Scheduling Techniques for Multimedia Computing in Hard Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DS-RT ![In: 7th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT 2003), 23-25 October 2003, Delft, The Netherlands, pp. 43-50, 2003, IEEE Computer Society, 0-7695-2036-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Alexander Bauer, Peter Rössler |
A Hard Real-Time Bus Arbitration Protocol based on EIA-709. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 14th Euromicro Conference on Real-Time Systems (ECRTS 2002), 19-21 June 2002, Vienna, Austria, Proceedings, pp. 127-133, 2002, IEEE Computer Society, 0-7695-1665-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Ian Broster, Guillem Bernat, Alan Burns 0001 |
Weakly Hard Real-time Constraints on Controller Area Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECRTS ![In: 14th Euromicro Conference on Real-Time Systems (ECRTS 2002), 19-21 June 2002, Vienna, Austria, Proceedings, pp. 134-141, 2002, IEEE Computer Society, 0-7695-1665-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Tobias Ritzau, Peter Fritzson |
Decreasing Memory Overhead in Hard Real-Time Garbage Collection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMSOFT ![In: Embedded Software, Second International Conference, EMSOFT 2002, Grenoble, France, October 7-9, 2002, Proceedings, pp. 213-226, 2002, Springer, 3-540-44307-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Jonas Holmerin |
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 544-552, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Jonas Holmerin |
Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - ε. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 6, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Guillem Bernat, Alan Burns 0001, Albert Llamosí |
Weakly Hard Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(4), pp. 308-321, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 388-391, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Victor B. Lortz, Kang G. Shin, Jinho Kim |
MDARTS: A Multiprocessor Database Architecture for Hard Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 12(4), pp. 621-644, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CBMS ![In: 13th IEEE Symposium on Computer-Based Medical Systems (CBMS 2000), 23-24 June 2000, Houston, TX, USA, pp. 19-24, 2000, IEEE Computer Society, 0-7695-0484-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 179-189, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Fridtjof Siebert |
Hard Real-Time Garbage-Collection in the Jamaica Virtual Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 6th International Workshop on Real-Time Computing and Applications Symposium (RTCSA '99), 13-16 December 1999, Hong Kong, China, pp. 96-102, 1999, IEEE Computer Society, 0-7695-0306-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Han Namgoong, Myung-Joon Kim |
Improved Hard Acknowledgement Deadline Protocol in Real-Time RPC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 25th EUROMICRO '99 Conference, Informatics: Theory and Practice for the New Millenium, 8-10 September 1999, Milan, Italy, pp. 2375-, 1999, IEEE Computer Society, 0-7695-0321-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Liming Cai, David W. Juedes, Iyad A. Kanj |
The Inapproximability of Non NP-hard Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 437-446, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Axel W. Krings, M. H. Azadmanesh |
Resource Reclaiming in Hard Real-Time Systems with Static and Dynamic Workloads. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (1) ![In: 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 7-10 January 1997, Maui, Hawaii, USA, pp. 616-625, 1997, IEEE Computer Society, 0-8186-7734-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Jongwon Lee, Sungyoung Lee, Hyungill Kim |
Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Languages, Compilers, & Tools for Real-Time Systems ![In: Proceedings of the ACM SIGPLAN 1995 Workshop on Languages, Compilers, & Tools for Real-Time Systems (LCT-RTS 1995). La Jolla, California, USA, June 21-22, 1995, pp. 7-19, 1995, ACM. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
16 | Ronald V. Book, Osamu Watanabe 0001 |
On Random Hard Sets for NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 47-55, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Bin Fu, Hong-Zhou Li |
On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 439-448, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Alan Burns 0001, Andy J. Wellings |
Designing Hard Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ada-Europe ![In: Ada: Moving Towards 2000, 11th Ada-Europe International Conference, Zandvoort, The Netherlands, June 1-5, 1992, Proceedings, pp. 116-127, 1992, Springer, 3-540-55585-4. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Miroslaw Kowaluk, Klaus W. Wagner |
Vector Language: Simple Description of Hard Instances (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 378-384, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Luc Longpré, Alan L. Selman |
Hard Promise Problems and Nonuniform Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings, pp. 216-226, 1990, Springer, 3-540-52282-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
Displaying result #401 - #500 of 21145 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|