|
|
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 |
20 | Jia Xu, David Lorge Parnas |
Correction to "On Satisfying Timing Constraints in Hard-Real-Time Systems''. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 19(3), pp. 310, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
scheduling, real-time systems, timing constraints, hard-real-time systems |
20 | Karsten Schwan, Hongyi Zhou |
Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 18(8), pp. 736-748, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
hard real-time tasks, real-time threads, real-time multiprocessor operating system kernel, scheduling, real-time systems, computational complexity, timing constraints, dynamic scheduling, network operating systems, precedence constraints, preemptive scheduling, worst-case complexity |
20 | Russell Impagliazzo, Leonid A. Levin |
No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 812-821, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
distributed NP problems, hard NP, DNP problem, P-time computable distributions, NP completeness, probability distributions, average-case complexity |
20 | John A. Stankovic |
Decentralized Decision Making for Task Reallocation in a Hard Real-Time System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(3), pp. 341-355, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
decentralised decision-making, task reallocation, simulation, scheduling, distributed system, real-time systems, performance analysis, distributed processing, deadlines, hard real-time system |
20 | Joseph C. Culberson, Robert A. Reckhow |
Covering Polygons Is Hard (Preliminary Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 601-611, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
minimum cover problems, arbitrary polygon, orthogonal polygon, NP-hard, boundary, covering problems, convex polygons, rectangles |
20 | Thomas E. Fuja, Chris Heegard |
Row/Column Replacement for the Control of Hard Defects in Semiconductor RAM's. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 35(11), pp. 996-1000, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
hard defects, RAM's, row/column replacement, reliability, redundancy, Error-control coding, yield improvement |
20 | Franz-Josef Brandenburg, Mao-cheng Cai |
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 4-15, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard |
20 | Mu Zhang 0004, Johnny Wong, Wallapak Tavanapong, Jung-Hwan Oh 0001, Piet C. de Groen |
Deadline-constrained media uploading systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Tools Appl. ![In: Multim. Tools Appl. 38(1), pp. 51-74, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
File upload, Emergency control for storage overflow, Scheduling algorithms, Hard real-time systems |
20 | He Jiang 0001, Xianchao Zhang 0001, Guoliang Chen 0001, Mingchu Li |
Backbone analysis and algorithm design for the quadratic assignment problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 51(5), pp. 476-488, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
backbone analysis, biased instance, NP-hard, meta-heuristic, quadratic assignment problem |
20 | Zoe Lin Jiang, Lucas Chi Kwong Hui, Siu-Ming Yiu |
Improving Disk Sector Integrity Using K-Dimension Hashing. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP Int. Conf. Digital Forensics ![In: Advances in Digital Forensics IV, Fourth Annual IFIP WG 11.9 Conference on Digital Forensics, Kyoto University, Kyoto, Japan, January 28-30, 2008, pp. 87-98, 2008, Springer, 978-0-387-84926-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Evidence integrity, k-dimension hashing, hard disks, hash values |
20 | R. Kapoor, S. R. Arora |
Complexity of a particular class of single and multiple ratio quadratic 0-1 fractional programming problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 7(2), pp. 285-298, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
0-1 Quadratic Fractional Programming, Global Verification, 90C32, Complexity, Local Search, NP-hard, 90C10, 90C60, 90C20 |
20 | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
Linear FPT reductions and computational lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 212-221, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
lower bound, complexity theory, NP-hard problems |
20 | Erik Yu-Shing Hu, Guillem Bernat, Andy J. Wellings |
A Static Timing Analysis Environment Using Java Architecture for Safety Critical Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WORDS ![In: 7th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2002), 7-9 January 2002, San Diego, CA, USA, pp. 77-84, 2002, IEEE Computer Society, 0-7695-1576-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Portable WCET Analysis, Java, Hard Real-Time Systems, Real-Time Java, Worst-Case Execution Time Analysis |
20 | Kwok-Wa Lam, Sheung-lun Hung |
A pre-emptive transaction scheduling protocol for controlling priority inversion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: Third International Workshop on Real-Time Computing Systems Application (RTCSA '96), October 30 - November 01, 1996, Seoul, Korea, pp. 144-, 1996, IEEE Computer Society, 0-8186-7626-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
pre-emptive transaction scheduling protocol, hard real-time database systems, priority inversion problem, system schedulability, blocking delay, transaction preemptability, worst-case scheduling conditions, semantics, data integrity, data consistency, priority inversion, concurrency control protocols, real-time transactions, priority ceiling protocols |
20 | Ira Pramanick, Jon G. Kuhl |
An Inherently Parallel Method for Heuristic Problem-Solving: Part I-General Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 6(10), pp. 1006-1015, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
heuristic problem solving, dynamic interaction, locally applied heuristics, NP-hard problems, inherently parallel |
19 | David Detlefs |
A Hard Look at Hard Real-Time Garbage Collection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISORC ![In: 7th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2004), 12-14 May 2004, Vienna, Austria, pp. 23-32, 2004, IEEE Computer Society, 0-7695-2124-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Brian B. Laird |
Do Your Hard-Spheres Have Tails? A Molecular Dynamics Integration Algorithm for Systems with Mixed Hard-Core/Continuous Potentials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (2) ![In: Computational Science - ICCS 2001, International Conference, San Francisco, CA, USA, May 28-30, 2001. Proceedings, Part II, pp. 1068, 2001, Springer, 3-540-42233-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Karl Bringmann, Tobias Friedrich 0001 |
Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMO ![In: Evolutionary Multi-Criterion Optimization, 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings, pp. 6-20, 2009, Springer, 978-3-642-01019-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Vincent Conitzer, Tuomas Sandholm, Jérôme Lang |
When are elections with few candidates hard to manipulate?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(3), pp. 14, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hardness of manipulation, voting, Computational social choice |
19 | Pin Zhou, Radu Teodorescu, Yuanyuan Zhou |
HARD: Hardware-Assisted Lockset-based Race Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCA ![In: 13st International Conference on High-Performance Computer Architecture (HPCA-13 2007), 10-14 February 2007, Phoenix, Arizona, USA, pp. 121-132, 2007, IEEE Computer Society, 1-4244-0804-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Hasan Guclu, Murat Yuksel |
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), June 25-29, 2007, Toronto, Ontario, Canada, pp. 32, 2007, IEEE Computer Society, 0-7695-2837-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Abhishek Pillai, Wei Zhang 0002, Dimitrios Kagaris |
Detecting VLIW Hard Errors Cost-Effectively through a Software-Based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA Workshops (1) ![In: 21st International Conference on Advanced Information Networking and Applications (AINA 2007), Workshops Proceedings, Volume 1, May 21-23, 2007, Niagara Falls, Canada, pp. 811-815, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Hai Jin 0001, Minghu Zhang, Pengliu Tan |
Dual-Level Traffic Smoothing Technique over Switched Ethernet for Hard Real-Time Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIS ![In: Computer and Information Sciences - ISCIS 2006, 21th International Symposium, Istanbul, Turkey, November 1-3, 2006, Proceedings, pp. 445-454, 2006, Springer, 3-540-47242-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Vladimir G. Deineko, Alexandre Tiskin |
One-Sided Monge TSP Is NP-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part III, pp. 793-801, 2006, Springer, 3-540-34075-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Miki Namatame, Muneo Kitajima |
Improving web usability for the hard-of-hearing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETRA ![In: Proceedings of the Eye Tracking Research & Application Symposium, ETRA 2006, San Diego, California, USA, March 27-29, 2006, pp. 39, 2006, ACM, 1-59593-305-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Venkatesan Guruswami, Alexander Vardy |
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(7), pp. 2249-2256, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Venkatesan Guruswami, Alexander Vardy |
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 470-478, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
19 | Sven Burmester, Holger Giese, Wilhelm Schäfer |
Model-Driven Architecture for Hard Real-Time Systems: From Platform Independent Models to Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECMDA-FA ![In: Model Driven Architecture - Foundations and Applications, 1st European Conference, ECMDA-FA 2005, Nuremberg, Germany, November 7-10, 2005, Proceedings, pp. 25-40, 2005, Springer, 3-540-30026-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Irith Pomeranz, Sudhakar M. Reddy, Sandip Kundu |
On the characterization and efficient computation of hard-to-detect bridging faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(12), pp. 1640-1649, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Luis Alejandro Cortés, Petru Eles, Zebo Peng |
Static Scheduling of Monoprocessor Real-Time Systems composed of Hard and Soft Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DELTA ![In: 2nd IEEE International Workshop on Electronic Design, Test and Applications (DELTA 2004), 28-30 January 2004, Perth, Australia, pp. 115-120, 2004, IEEE Computer Society, 0-7695-2081-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Basheer Al-Duwairi, Govindarasu Manimaran |
Combined Scheduling of Hard and Soft Real-Time Tasks in Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2003, 10th International Conference, Hyderabad, India, December 17-20, 2003, Proceedings, pp. 279-289, 2003, Springer, 3-540-20626-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Adi Akavia, Shafi Goldwasser, Shmuel Safra |
Proving Hard-Core Predicates Using List Decoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 146-157, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Vincent Conitzer, Jérôme Lang, Tuomas Sandholm |
How many candidates are needed to make elections hard to manipulate? ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2003), Bloomington, Indiana, USA, June 20-22, 2003, pp. 201-214, 2003, ACM, 1-58113-731-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Peter P. Puschner |
Hard Real-Time Programming is Different. ![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. 116, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Peter P. Puschner |
Algorithms for Dependable Hard Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WORDS ![In: 8th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2003), 15-17 January 2003, Guadalajara, Mexico, pp. 26-31, 2003, IEEE Computer Society, 0-7695-1929-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Moni Naor |
Moderately Hard Functions: From Complexity to Spam Fighting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pp. 434-442, 2003, Springer, 3-540-20680-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Julia Chuzhoy, Joseph Naor |
Covering Problems with Hard Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 481-489, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Guillem Bernat, Ricardo Cayssials |
Guaranteed On-Line Weakly-Hard Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 22nd IEEE Real-Time Systems Symposium (RTSS 2001), London, UK, 2-6 December 2001, pp. 25-35, 2001, IEEE Computer Society, 0-7695-1420-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Pascal Chevochot, Antoine Colin, David Decotigny, Isabelle Puaut |
Are COTS Suitable for Building Distributed Fault-Tolerant Hard Real-Time Systems?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS Workshops ![In: Parallel and Distributed Processing, 15 IPDPS 2000 Workshops, Cancun, Mexico, May 1-5, 2000, Proceedings, pp. 699-705, 2000, Springer, 3-540-67442-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Jae-dong Lee |
A Hard Real-Time Tasks Model for the VBR Video Server. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC ![In: 2000 International Symposium on Information Technology (ITCC 2000), 27-29 March 2000, Las Vegas, NV, USA, pp. 190-194, 2000, IEEE Computer Society, 0-7695-0540-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Adam R. Klivans, Rocco A. Servedio |
Boosting and Hard-Core Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 624-633, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Juraj Hromkovic |
Stability of Approximation Algorithms for Hard Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27 - December 4, 1999, Proceedings, pp. 29-47, 1999, Springer, 3-540-66694-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Lance Fortnow, Aduri Pavan, Alan L. Selman |
Distributionally-Hard Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 184-193, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Jack H. Lutz, Elvira Mayordomo |
Measure, Stochasticity, and the Density of Hard Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 38-47, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
19 | Evgeny V. Shchepin, Nodari Vakhania |
On the geometry, preemptions and complexity of multiprocessor and shop scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 183-213, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Shop scheduling, Algorithm, Time complexity, Multiprocessor scheduling, Preemption |
19 | Josep Argelich, Felip Manyà |
Partial Max-SAT Solvers with Clause Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings, pp. 28-40, 2007, Springer, 978-3-540-72787-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Paolo Liberatore |
Complexity results on DPLL and resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(1), pp. 84-107, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Davis-Putnam, NP-completeness, propositional satisfiability |
19 | Harry Buhrman, Montserrat Hermo |
On the Sparse Set Conjecture for Sets with Low Denisty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 609-618, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
17 | Marc Schlickling, Markus Pister 0002 |
Semi-automatic derivation of timing models for WCET analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES ![In: Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems, LCTES 2010, Stockholm, Sweden, April 13-15, 2010, pp. 67-76, 2010, ACM, 978-1-60558-953-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
vhdl, worst-case execution time, hard real-time |
17 | Shu Liu, Xu Cheng 0001, Xuetao Guan, Dong Tong 0001 |
Energy efficient management scheme for heterogeneous secondary storage system in mobile computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 251-257, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
heterogeneous secondary storage, flash memory, energy saving, hard disk |
17 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov |
On Two Techniques of Combining Branching and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(2), pp. 181-207, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms |
17 | Srivatsan Narayanan, Ananth Raghunathan, Ramarathnam Venkatesan |
Obfuscating straight line arithmetic programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Digital Rights Management Workshop ![In: Proceedings of the 9th ACM Workshop on Digital Rights Management, Chicago, Illinois, USA, November 9, 2009, pp. 47-58, 2009, ACM, 978-1-60558-779-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hard-to-factor polynomials, straight line arithmetic programs, drm, obfuscation, software protection, secure hardware |
17 | David Fick, Andrew DeOrio, Jin Hu, Valeria Bertacco, David T. Blaauw, Dennis Sylvester |
Vicis: a reliable network for unreliable silicon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 46th Design Automation Conference, DAC 2009, San Francisco, CA, USA, July 26-31, 2009, pp. 812-817, 2009, ACM, 978-1-60558-497-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hard faults, fault tolerance, built-in-self-test, Network-on-Chip, reconfiguration, torus, N-modular redundancy |
17 | Joseph Y.-T. Leung, Hairong Zhao |
Scheduling problems in master-slave model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 215-231, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Master slave model, Approximation algorithms, NP-hard, Makespan, Total completion time |
17 | Xin Chen 0037, Lan Liu 0001, Zheng Liu, Tao Jiang 0001 |
On the minimum common integer partition problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(1), pp. 12:1-12:18, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithm, combinatorial optimization, NP-hard, computational biology, Subset sum, integer partition |
17 | Ning Chen, Atri Rudra |
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(1), pp. 44-64, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Walrasian equilibrium, Single-minded auction, Approximation, NP-hard, Combinatorial auction |
17 | Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David B. Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller 0001, Isabelle Puaut, Peter P. Puschner, Jan Staschulat, Per Stenström |
The worst-case execution-time problem - overview of methods and survey of tools. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 7(3), pp. 36:1-36:53, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
worst-case execution times, Hard real time |
17 | Danyu Bai, Lixin Tang, Meng Su |
A New Machine Scheduling Problem with Temperature Loss. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WKDD ![In: Proceedings of the International Workshop on Knowledge Discovery and Data Mining, WKDD 2008, Adelaide, Australia, 23-24 January 2008, pp. 662-666, 2008, IEEE Computer Society, 0-7695-3090-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Temperature Drop Curve, Total Temperature Drop Loss, Scheduling, NP-hard |
17 | Richard Kheir, Thomas P. Way |
Inclusion of deaf students in computer science classes using real-time speech transcription. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007, pp. 261-265, 2007, ACM, 978-1-59593-610-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
deaf students, hard of hearing students, accessibility, speech recognition, computer science education, assistive technology, inclusion |
17 | Miki Namatame, Fusako Kusunoki |
Learning onomatopoeic expressions by animation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Computer Entertainment Technology ![In: Proceedings of the International Conference on Advances in Computer Entertainment Technology, ACE 2007, Salzburg, Austria, June 13-15, 2007, pp. 143-146, 2007, ACM, 978-1-59593-640-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hard-of-hearing, onomatopoeic, visualization, animation |
17 | Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh |
Filtering Algorithms for the NValueConstraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 11(4), pp. 271-293, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
NValue constraint, AtleastNValue, AtMostNValue, NP-hard, pruning, global constraints, linear relaxation |
17 | Binwu Zhang, Jianzhong Zhang 0001, Liqun Qi 0001 |
The shortest path improvement problems under Hamming distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 12(4), pp. 351-361, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
NP-hard, Hamming distance, Shortest path problem |
17 | Mohammad Azam Rana, Halim Setan, Zulkepli Majid, Albert K. Chong |
Computer Assisted Surgical Planner for Craniofacial Reconstruction - Imaging Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMAI ![In: 2006 International Conference on Geometric Modeling and Imaging, GMAI 2006, London, UK, July 5-7, 2006, pp. 215-220, 2006, IEEE Computer Society, 0-7695-2604-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
surgical planner, hard tissue, cutting, CAS, soft tissue |
17 | Guido Pennella, Christian Di Biagio, Alessandro Colicchia, Gianfranco Pesce, Giovanni Cantone |
Monitoring Distributed Systems for Safety Critical Software: A Goal-Driven Approach and Prototype-Tool. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA Workshops ![In: Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops, ISPA 2006 International Workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006, Proceedings, pp. 241-250, 2006, Springer, 3-540-49860-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Performance-measurement Tools, Software engineering, Hard Real-time Systems, Distributed and parallel systems |
17 | Linda Dailey Paulson |
News Briefs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer ![In: Computer 38(8), pp. 26-28, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hard-drive systems, FPGAs, reconfigurable computing, flash memory, Wi-Fi, supercomputers, location services, power-aware computing |
17 | Qizhi Fang, Hye Kyung Kim, Dae Sik Lee |
Total Dominating Set Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings, pp. 520-530, 2005, Springer, 3-540-30900-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Rigid total dominating set game, relaxed total dominating set game, core, balancedness, hard |
17 | Jesús Fabián López Pérez |
A Meta-heuristic Applied for a Topologic Pickup and Delivery Problem with Time Windows Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part III, pp. 924-928, 2005, Springer, 3-540-26044-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Genetic Algorithms, NP-Hard, Logistics, Time Windows |
17 | Masayuki Nakamura, Hiroki Nomiya, Kuniaki Uehara |
Improvement of Boosting Algorithm by Modifying the Weighting Rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 41(1), pp. 95-109, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
hard example, weighting rule, errorbound, NadaBoost, AdaBoost |
17 | Esther Ezra, Micha Sharir |
Counting and representing intersections among triangles in three dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 210-219, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
3SUM-hard problems, counting intersections, curve-sensitive cuttings, triangles in three dimensions, arrangements |
17 | Sanjoy K. Baruah, Shelby H. Funk, Joël Goossens |
Robustness Results Concerning EDF Scheduling upon Uniform Multiprocessors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 52(9), pp. 1185-1195, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Uniform multiprocessors, robustness, earliest deadline first, hard-real-time systems, resource augmentation |
17 | Nikolay P. Varnovsky, Vladimir A. Zakharov |
On the Possibility of Provably Secure Obfuscating Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ershov Memorial Conference ![In: Perspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers, pp. 91-102, 2003, Springer, 3-540-20813-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
hard-core predicate, security, program transformation, mutual information, obfuscation, one-way function |
17 | Jan Poland, Kosmas Knödler, Alexander Mitterer, Thomas Fleischhauer, Frank Zuber-Goos, Andreas Zell |
Evolutionary Search for Smooth Maps in Motor Control Unit Calibration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings, pp. 107-116, 2001, Springer, 3-540-43025-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Control Unit Calibration, Variable Alphabet Coding, Hybrid GA, Smooth Maps, Genetic Algorithm, Combinatorial Optimization, NP-hard |
17 | Daeyoung Kim 0001, Yann-Hang Lee |
DC2 scheduling for aperiodic tasks in strongly partitioned real-time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 12-14 December 2000, Cheju Island, South Korea, pp. 368-, 2000, IEEE Computer Society, 0-7695-0930-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
DC/sup 2/ scheduling, aperiodic task scheduling, strongly partitioned real time systems, SP-RTS, integrated real time applications, two-level hierarchical scheduling mechanism, multiple partitions, multiple periodic tasks, fixed priority algorithm, Distance Constraint guaranteed Dynamic Cyclic scheduler, distance-constrained cyclic schedule, distance constraint characteristics, partition cyclic schedule, slack time calculation, dynamic operations, hard aperiodic tasks, DC/sup 2/, soft aperiodic tasks, acceptance rate, scheduling, real-time systems, computational complexity, online scheduling, cyclic scheduling, spatial partitioning, partition scheduling, dynamic applications |
17 | Luca Abeni, Giorgio C. Buttazzo |
Support for dynamic QoS in the HARTIK kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 12-14 December 2000, Cheju Island, South Korea, pp. 65-72, 2000, IEEE Computer Society, 0-7695-0930-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
dynamic QoS support, HARTIK, hard real-time kernel, control applications, soft real-time applications, service mechanism, temporal protection abstraction, service quality manager, reserved resource adaptation, task requirements, quality of service, real-time systems, stability, multimedia applications, multimedia computing, operating system kernels, computerised control, robot applications |
17 | LihChyun Shu, Michal Young |
Chopping and versioning real-time transactions to avoid remote blocking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: 7th International Workshop on Real-Time Computing and Applications Symposium (RTCSA 2000), 12-14 December 2000, Cheju Island, South Korea, pp. 93-101, 2000, IEEE Computer Society, 0-7695-0930-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
real time transaction versioning, remote blocking, versioning protocols, chopping analysis, pure locking protocols, 1-version serializability, design time information, simple data structures, small bounded overheads, worst case access times, scheduling, real-time systems, protocols, concurrency control, multiprocessors, multiprocessing systems, transaction processing, configuration management, schedulability analysis, hard real time systems, critical sections, locking protocols, database concurrency control |
17 | Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo Han, Ju-Sung Kang, Choonsik Park |
New Public-Key Cryptosystem Using Braid Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings, pp. 166-183, 2000, Springer, 3-540-67907-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
hard problem, non-commutative group, public key cryptosystem, public key infrastructure, key exchange, one-way function, braid group, conjugacy problem |
17 | Jianzhong Zhang 0001, Xiaoguang Yang, Mao-cheng Cai |
Reverse Center Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 279-294, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
networks and graphs, maximum cost circulation. ams subject classification. 68q25, np-hard, 90c27, relaxation, satisfiability problem |
17 | Steffen Reith, Klaus W. Wagner |
On Boolean Lowness and Boolean Highness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings, pp. 147-156, 1998, Springer, 3-540-64824-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
lowness, highness, boolean lowness, boolean highness, boolean hierarchy, hard/easy, Computational complexity, advice, polynomial-time hierarchy, collapse |
17 | James H. Anderson, Srikanth Ramamurthy, Kevin Jeffay |
Real-Time Computing with Lock-Free Shared Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Syst. ![In: ACM Trans. Comput. Syst. 15(2), pp. 134-165, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
scheduling, synchronization, earliest deadline first, hard real time, wait free, lock free, critical sections, rate monotonic, deadline monotonic |
17 | Ching-Chuan Chiang, Mario Gerla, Lixia Zhang 0001 |
Shared Tree Wireless Network Multicast. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1997), September 22-25, 1997 Las Vegas, NV, USA, pp. 28-33, 1997, IEEE Computer Society, 0-8186-8186-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Hard state, Soft Stat, Clustering, Routing, Multicast, Multihop Wireless Networks |
17 | Peter J. Stuckey, Vincent W. L. Tam |
Extending EGENET with Lazy Constraint Consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 9th International Conference on Tools with Artificial Intelligence, ICTAI '97, Newport Beach, CA, USA, November 3-8, 1997, pp. 248-, 1997, IEEE Computer Society, 0-8186-8203-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
extended EGENET, lazy constraint consistency, neural network simulator, min-conflict heuristic, hard graph-colouring problems, complete search methods, stochastic search methods, convergence behaviour, scheduling, planning (artificial intelligence), planning, constraint satisfaction problems, bin-packing, arc consistency, search behaviour |
17 | Ismael Ripoll, Ana García-Fornes, Alfons Crespo |
Optimal aperiodic scheduling for dynamic-priority systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: Third International Workshop on Real-Time Computing Systems Application (RTCSA '96), October 30 - November 01, 1996, Seoul, Korea, pp. 294-300, 1996, IEEE Computer Society, 0-8186-7626-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
optimal aperiodic scheduling, dynamic-priority systems, soft real-time constraints, hard real-time constraints, on-line aperiodic admission algorithm, optimal dynamic priority preemptive scheduler, shortest response time, soft aperiodic tasks, dynamic priority schedulers, firm deadline aperiodic tasks, real-time systems, fixed priority schedulers |
17 | Jinho Kim, Kang G. Shin |
On data logging in real-time process control systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTCSA ![In: Third International Workshop on Real-Time Computing Systems Application (RTCSA '96), October 30 - November 01, 1996, Seoul, Korea, pp. 320-, 1996, IEEE Computer Society, 0-8186-7626-4. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
data logging, real-time process control systems, hard real-time data logging tasks, integrated scheduling scheme, soft real-time monitoring tasks, timeliness guarantees, real-time disk scheduling algorithm, UNIX, process control, general-purpose operating systems |
17 | Steven G. Woods, Qiang Yang 0001 |
The Program Understanding Problem: Analysis and a Heuristic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: 18th International Conference on Software Engineering, Berlin, Germany, March 25-29, 1996, Proceedings., pp. 6-15, 1996, IEEE Computer Society, 0-8186-7246-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
complex source code, formal complexity results, heuristic solutions, problem solving model, program understanding problem, computational complexity, reverse engineering, conceptual models, NP hard, CSPs, search problems, constraint satisfaction problems, constraint propagation, search algorithms, constraint handling, heuristic approach |
17 | Stefan Radtke, Jens Bargfrede, Walter Anheier |
Distributed automatic test pattern generation with a parallel FAN algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 698-702, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
distributed automatic test pattern generation, parallel FAN algorithm, backtracking mechanism, heterogeneous cluster of workstations, test vector compaction, genetic algorithms, genetic algorithm, parallel algorithms, computational complexity, logic testing, digital circuits, digital circuits, NP hard problem, sequential algorithms |
17 | Yung-Sheng Chen |
Computer processing on the identification of a Chinese seal image. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume I, pp. 422-425, 1995, IEEE Computer Society, 0-8186-7128-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Chinese seal image identification, hard-matching, human visual inspection, optical character recognition, image recognition |
17 | Steve Vestal |
Fixed-Priority Sensitivity Analysis for Linear Compute Time Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(4), pp. 308-317, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
fixed-priority sensitivity analysis, linear computation time models, scheduling discipline, hard real-time periodic tasks, task scheduling feasibility, real-time verification, real-time benchmarking, real-time architectures, scheduling, real-time systems, computational complexity, formal verification, software components, real-time scheduling, sensitivity analysis, modules, schedulability analysis, software development process, rate monotonic scheduling, task decomposition, fixed-priority preemptive scheduling, uniprocessor |
17 | M. Bozyigit, M. Melhi |
Dynamic Load Balancing in Distributed Real-Time Systems (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, CSC '90, Sheraton Washington Hotel, Washington, DC, USA, February 20-22, 1990, pp. 433, 1990, ACM, 0-89791-348-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
distributed realtime system, graph theoretic, linear and nonlinear programming, incremental heuristic refinement algorithm, Load balancing, NP-hard |
16 | Thomas Terkildsen, Lene Engelst, Mathias Clasen |
Work Hard, Scare Hard? An Investigation of How Mental Workload Impacts Jump Scare Intensity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Hum. Comput. Interact. ![In: Proc. ACM Hum. Comput. Interact. 7(CHI), pp. 27-44, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Arne F. Nix, Max F. Burg, Fabian H. Sinz |
HARD: Hard Augmentations for Robust Distillation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.14890, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Bo Xu 0023, Shouang Wei, Luyi Cheng, Shizhou Huang, Hui Song, Ming Du, Hongya Wang |
HSimCSE: Improving Contrastive Learning of Unsupervised Sentence Representation with Adversarial Hard Positives and Dual Hard Negatives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: International Joint Conference on Neural Networks, IJCNN 2023, Gold Coast, Australia, June 18-23, 2023, pp. 1-8, 2023, IEEE, 978-1-6654-8867-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki |
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCN ![In: Security and Cryptography for Networks - 13th International Conference, SCN 2022, Amalfi, Italy, September 12-14, 2022, Proceedings, pp. 45-68, 2022, Springer, 978-3-031-14790-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Federico Bonetti, Elisa Leonardelli, Daniela Trotta, Raffaele Guarasci, Sara Tonelli |
Work Hard, Play Hard: Collecting Acceptability Annotations through a 3D Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LREC ![In: Proceedings of the Thirteenth Language Resources and Evaluation Conference, LREC 2022, Marseille, France, 20-25 June 2022, pp. 1740-1750, 2022, European Language Resources Association. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
16 | Bryce Goodman |
Hard Choices and Hard Limits for Artificial Intelligence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.07852, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki |
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 801, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Damianos Galanopoulos, Vasileios Mezaris |
Hard-Negatives or Non-Negatives? A Hard-Negative Selection Strategy for Cross-Modal Retrieval Using the Improved Marginal Ranking Loss. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCVW ![In: IEEE/CVF International Conference on Computer Vision Workshops, ICCVW 2021, Montreal, BC, Canada, October 11-17, 2021, pp. 2312-2316, 2021, IEEE, 978-1-6654-0191-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Zhun Fan, Zhi Yang 0007, Yajuan Tang, Wenji Li, Biao Xu, Zhaojun Wang, Fuzan Sun, Zhoubin Long, Guijie Zhu |
An Improved Epsilon Method with M2M for Solving Imbalanced CMOPs with Simultaneous Convergence-Hard and Diversity-Hard Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMO ![In: Evolutionary Multi-Criterion Optimization - 11th International Conference, EMO 2021, Shenzhen, China, March 28-31, 2021, Proceedings, pp. 248-256, 2021, Springer, 978-3-030-72061-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Bryce Goodman |
Hard Choices and Hard Limits in Artificial Intelligence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIES ![In: AIES '21: AAAI/ACM Conference on AI, Ethics, and Society, Virtual Event, USA, May 19-21, 2021, pp. 112-121, 2021, ACM, 978-1-4503-8473-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
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) |
J. Inf. Process. ![In: J. Inf. Process. 28, pp. 919-928, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Alexisz Tamás Gaál |
Long-range orientational order of random near-lattice hard sphere and hard disk processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Probab. ![In: J. Appl. Probab. 57(2), pp. 559-577, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 21145 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|