|
|
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 |
11 | Lili Tan |
The worst-case execution time tool challenge 2006. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 11(2), pp. 133-152, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Embedded systems, Timing analysis, Worst-case execution time, WCET, Hard real time |
11 | Dariusz Barbucha, Ireneusz Czarnowski, Piotr Jedrzejowicz, Ewa Ratajczak-Ropel, Izabela Wierzbowska |
e-JABAT - An Implementation of the Web-Based A-Team. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Intelligent Agents in the Evolution of Web and Applications ![In: Intelligent Agents in the Evolution of Web and Applications, pp. 57-86, 2009, Springer, 978-3-540-88070-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
JABAT, A-Team, computionally hard problems, optimization, multi-agents systems |
11 | Byron J. Gao, Mingji Xia, Walter Cai, David C. Anastasiu |
The gardener's problem for web information monitoring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 1525-1528, 2009, ACM, 978-1-60558-512-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
gardener's problem, multicriteria maintenance scheduling, web information monitoring, np-hard, olap |
11 | Lasse Kliemann, Anand Srivastav |
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: Experimental Algorithms, 8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings, pp. 185-196, 2009, Springer, 978-3-642-02010-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hypergraph matching, approximation algorithms, greedy algorithms, hybrid algorithms, NP-hard problems, randomized rounding |
11 | Maik Hadorn, Peter Eggenberger Hotz |
Multivesicular Assemblies as Real-World Testbeds for Embryogenic Evolutionary Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACAL ![In: Artificial Life: Borrowing from Biology, 4th Australian Conference, ACAL 2009, Melbourne, Australia, December 1-4, 2009. Proceedings, pp. 169-178, 2009, Springer, 978-3-642-10426-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Embryogenic evolution, real-world testbed, vesicles, hard sphere colloids, DNA, programmability, self-assembly |
11 | Kai Lampka, Simon Perathoner, Lothar Thiele |
Analytic real-time analysis and timed automata: a hybrid method for analyzing embedded real-time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMSOFT ![In: Proceedings of the 9th ACM & IEEE International conference on Embedded software, EMSOFT 2009, Grenoble, France, October 12-16, 2009, pp. 107-116, 2009, ACM, 978-1-60558-627-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
performance analysis, timed automata, hard real-time systems, real-time calculus |
11 | Stephan Wilhelm, Björn Wachter |
Symbolic state traversal for WCET analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMSOFT ![In: Proceedings of the 9th ACM & IEEE International conference on Embedded software, EMSOFT 2009, Grenoble, France, October 12-16, 2009, pp. 137-146, 2009, ACM, 978-1-60558-627-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
abstract interpretation, binary decision diagram, worst-case execution time, hard real time, processor models |
11 | Ireneusz Czarnowski, Piotr Jedrzejowicz, Izabela Wierzbowska |
A-Team Middleware on a Cluster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES-AMSTA ![In: Agent and Multi-Agent Systems: Technologies and Applications, Third KES International Symposium, KES-AMSTA 2009, Uppsala, Sweden, June 3-5, 2009. Proceedings, pp. 764-772, 2009, Springer, 978-3-642-01664-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
JABAT, A-Team, computionally hard problems, cluster, optimization, multi-agents systems |
11 | Sarvesh Kumar Varatharajan, Gunes Ercal-Ozkaya |
On a Local Heuristic for a Reverse Multicast Forwarding Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NetCoM ![In: First International Conference on Networks and Communications, NetCoM 2009, Chennai, India, December 27-29, 2009, pp. 307-312, 2009, IEEE Computer Society, 978-0-7695-3924-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
incentive compatible topology control, heuristics for NP-Hard problems, random Euclidean power graphs, sensor networks, game theory, local algorithm, location based routing |
11 | Johan Håstad, Mats Näslund |
Practical Construction and Analysis of Pseudo-Randomness Primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 21(1), pp. 1-26, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Hard core function, One-way function, Pseudo random generator, Exact security |
11 | Fedor V. Fomin, Fabrizio Grandoni 0001, Dieter Kratsch |
Solving Connected Dominating Set Faster than 2 n . ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 153-166, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Exponential-time exact algorithm, Maximum leaf spanning tree, Connected dominating set, NP-hard problem |
11 | Jun Yan 0008, Wei Zhang 0002 |
Analyzing the worst-case execution time for instruction caches with prefetching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Embed. Comput. Syst. ![In: ACM Trans. Embed. Comput. Syst. 8(1), pp. 7:1-7:19, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
instruction caches, hard real-time, Worst-case execution time analysis, instruction prefetching |
11 | Davood Shamsi, Farinaz Koushanfar, Miodrag Potkonjak |
Challenging benchmark for location discovery in ad hoc networks: foundations and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, pp. 361-370, 2008, ACM, 978-1-60558-073-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
add hoc networks, hard instances, localization, benchmarks, NP-complete problem |
11 | Ke Zeng, Jianzhong Zhang, Hang Qiu 0002 |
Real-Time Shadow Research in Virtual Environment with Higher Complexity and Larger Shadow Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PACIIA (1) ![In: PACIIA 2008, Volume 1, 2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application, 19-20 December 2008, Wuhan, China, pp. 436-440, 2008, IEEE Computer Society, 978-0-7695-3490-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hard shadow, higher complexity and larger shadow regions, real-time shadow, virtual environment, soft shadow |
11 | Valentin E. Brimkov |
Scaling of Plane Figures That Assures Faithful Digitization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis, 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. Proceedings, pp. 87-98, 2008, Springer, 978-3-540-78274-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
lattice polygon, polyhedral reconstruction, NP-hard problem, digital geometry, scaling factor |
11 | Joaquín Izquierdo 0001, Idel Montalvo, Rafael Pérez-García, Mario Tavera |
Optimization in water systems: a PSO approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SpringSim ![In: Proceedings of the 2008 Spring Simulation Multiconference, SpringSim 2008, Ottawa, Canada, April 14-17, 2008, pp. 239-246, 2008, SCS/ACM, 1-56555-319-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
water industry, particle swarm optimization, NP-hard problem, evolutionary optimization |
11 | Rushil Raghavjee, Nelishia Pillay |
An application of genetic algorithms to the school timetabling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAICSIT ![In: Proceedings of the 2008 Annual Conference of the South African Institute of Computer Scientists and Information Technologists on IT Research in Developing Countries, SAICSIT 2008, Wilderness, South Africa, October 6-8, 2008, pp. 193-199, 2008, ACM, 978-1-60558-286-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hard constraints, school timetabling problem, timetabling problems, genetic algorithms |
11 | Dariusz Barbucha, Ireneusz Czarnowski, Piotr Jedrzejowicz, Ewa Ratajczak-Ropel, Izabela Wierzbowska |
Web Accessible A-Team Middleware. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (3) ![In: Computational Science - ICCS 2008, 8th International Conference, Kraków, Poland, June 23-25, 2008, Proceedings, Part III, pp. 624-633, 2008, Springer, 978-3-540-69388-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
JABAT, A-Team, computionally hard problems, optimization, multi-agents systems |
11 | László Szilágyi, David Iclanzan, Sándor M. Szilágyi, Dan Dumitrescu |
GeCiM: A Novel Generalized Approach to C-Means Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIARP ![In: Progress in Pattern Recognition, Image Analysis and Applications, 13th Iberoamerican Congress on Pattern Recognition, CIARP 2008, Havana, Cuba, September 9-12, 2008. Proceedings, pp. 235-242, 2008, Springer, 978-3-540-85919-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
possibilistic c-means clustering, hard c-means clustering, evolutionary computation, fuzzy c-means clustering |
11 | Takaaki Okura, Yoko Hirose |
Development of a Web Type DVD Viewer Synchronized with Multilingual Captions for Existing DVDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCHP ![In: Computers Helping People with Special Needs, 11th International Conference, ICCHP 2008, Linz, Austria, July 9-11, 2008. Proceedings, pp. 640-646, 2008, Springer, 978-3-540-70539-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Deaf and Hard of Hearing, e-Learning, Web, Caption, DVD |
11 | Jittat Fakcharoenphol, Bundit Laekhanukit |
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 153-158, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms for NP-hard problems, k-connected spanning subgraphs, network design |
11 | Santiago Urueña, José Antonio Pulido, Jorge López, Juan Zamorano, Juan Antonio de la Puente |
A New Approach to Memory Partitioning in On-Board Spacecraft Software. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ada-Europe ![In: Reliable Software Technologies - Ada-Europe 2008, 13th Ada-Europe International Conference on Reliable Software Technologies, Venice, Italy, June 16-20, 2008. Proceedings, pp. 1-14, 2008, Springer, 978-3-540-68621-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Ravenscar Ada, integrated modular avionics, embedded systems, hard real-time, high-integrity |
11 | Jing-Fa Liu, Wen-Qi Huang |
Quasi-Physical Algorithm of an Off-Lattice Model for Protein Folding Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 22(4), pp. 569-574, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
off-lattice model, quasi-physical algorithm, off-trap strategy, protein folding, NP-hard problem |
11 | Randeep Bhatia, Julia Chuzhoy, Ari Freund 0001, Joseph Naor |
Algorithmic aspects of bandwidth trading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(1), pp. 10:1-10:19, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms for NP-hard problems, scheduling, resource allocation, dynamic storage allocation, general caching |
11 | Aggelos Ioannou, Manolis Katevenis |
Pipelined heap (priority queue) management for advanced scheduling in high-speed networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(2), pp. 450-461, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
high-speed network scheduling, pipelined hard-ware heap, synthesizable core, weighted fair queueing, priority queue, weighted round robin |
11 | Xiaoning Ding, Song Jiang 0001, Feng Chen 0005 |
A buffer cache management scheme exploiting both temporal and spatial localities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Storage ![In: ACM Trans. Storage 3(2), pp. 5:1-5:27, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Caching, file systems, temporal locality, spatial locality, hard disk |
11 | Jingui Huang, Jianer Chen, Songqiao Chen, Jianxin Wang 0001 |
A simple linear time approximation algorithm for multi-processor job scheduling on four processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(1), pp. 33-45, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multi-processor job scheduling, Approximation algorithm, NP-hard problem |
11 | Clayton W. Commander, Panos M. Pardalos, Valeriy Ryabchenko, Stan Uryasev, Grigoriy Zrazhevsky |
The wireless network jamming problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(4), pp. 481-498, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Network interdiction, Percentile constraints, Integer programming, NP-hard, Jamming |
11 | Shuqiang Chen, Qizhi Fang |
Call Control and Routing in SONET Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 260-270, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
SONET ring, routing, approximation algorithm, hard, call |
11 | Jun Yan 0008, Wei Zhang 0002 |
WCET analysis of instruction caches with prefetching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES ![In: Proceedings of the 2007 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'07), San Diego, California, USA, June 13-15, 2007, pp. 175-184, 2007, ACM, 978-1-59593-632-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
instruction cache, hard real-time, worst-case execution time analysis, instruction prefetching |
11 | Jouko Kokko, Erkki Kemppainen, Aulikki Rautavaara |
Technology and Regional Social Structures: Evaluation of Remote Sign Language Interpretation in Finland. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HCI (5) ![In: Universal Access in Human Computer Interaction. Coping with Diversity, 4th International Conference on Universal Access in Human-Computer Interaction, UAHCI 2007, Held as Part of HCI International 2007, Beijing, China, July 22-27, 2007, Proceedings, Part I, pp. 716-721, 2007, Springer, 978-3-540-73278-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Interpretation service, hard of hearing people, Disability, ICT |
11 | Yu-Hang Tsai, Kuochen Wang, Jheng-Ming Chen |
A deferred-workload-based inter-task dynamic voltage scaling algorithm for portable multimedia devices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2007, Honolulu, Hawaii, USA, August 12-16, 2007, pp. 677-682, 2007, ACM, 978-1-59593-695-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
actual workload, deferred-workload-based, inter-task dynamic voltage scaling, worst-case execution time, hard real-time system, slack time |
11 | Qunwei Zheng, Sibabrata Ray, Xiaoyan Hong, Lei Tang, Li Gao |
Integrity and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 45th Annual Southeast Regional Conference, 2007, Winston-Salem, North Carolina, USA, March 23-24, 2007, pp. 350-354, 2007, ACM, 978-1-59593-629-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
integrity, NP-hard |
11 | Jürg Wullschleger |
Oblivious-Transfer Amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings, pp. 555-572, 2007, Springer, 978-3-540-72539-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
oblivious-transfer amplification, universal oblivious transfer, weak oblivious transfer, computational weak oblivious transfer, distributed leftover hash lemma, hard-core lemma |
11 | Florian Eibensteiner, Rainer Findenig, Jürgen Tossold, Wilfried Kubinger, Josef Langer, Markus Pfaff |
Embedded Robotic Solution: Integrating Robotics Interfaces with a High-Level CPU in a System-on-a-Chip. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAST ![In: Computer Aided Systems Theory - EUROCAST 2007, 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 12-16, 2007, Revised Selected Papers, pp. 1017-1024, 2007, Springer, 978-3-540-75866-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Robotics, System-on-a-Chip, hard real-time, RTOS |
11 | Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh |
Survivable network design with degree or order constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 651-660, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, NP-hard problems, bounded degree, iterative rounding |
11 | Ratnabali Biswas, Kaushik R. Chowdhury, Dharma P. Agrawal |
Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Wirel. Inf. Networks ![In: Int. J. Wirel. Inf. Networks 13(4), pp. 303-315, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
storage node, control node, correlation tree, aggregation tree, hard threshold, update epoch, Data-centric storage, soft threshold, allocation problem |
11 | Kun-Feng Lin, Chuan-Ming Liu |
Broadcasting dependent data with minimized access latency in a multi-channel environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2006, Vancouver, British Columbia, Canada, July 3-6, 2006, pp. 809-814, 2006, ACM, 1-59593-306-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
broadcasting, latency, NP-hard, DAG, multiple channels |
11 | Guodong Rong, Tiow Seng Tan |
Utilizing jump flooding in image-based soft shadows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VRST ![In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology, VRST 2006, Limassol, Cyprus, November 1-3, 2006, pp. 173-180, 2006, ACM, 1-59593-321-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
hard shadow, penumbra map, interactive application, programmable graphics hardware, game programming, parallel prefix |
11 | D. Kebbal |
Automatic Flow Analysis Using Symbolic Execution and Path Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 2006 International Conference on Parallel Processing Workshops (ICPP Workshops 2006), 14-18 August 2006, Columbus, Ohio, USA, pp. 397-404, 2006, IEEE Computer Society, 0-7695-2637-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
static WCET analysis, automatic parametric flow analysis, block-based symbolic execution, path enumeration, hard real-time systems |
11 | Andreas Ermedahl, Friedhelm Stappert, Jakob Engblom |
Clustered Worst-Case Execution-Time Calculation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(9), pp. 1104-1122, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
WCET calculation, embedded systems, hard real-time, WCET analysis |
11 | Wieslaw Kubiak |
Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 8(4), pp. 295-302, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
just-in-time sequencing, the Liu-Layland problem, apportionment problem, hard real-time systems, periodic scheduling |
11 | Xiaodong Gu, Guoliang Chen 0001, Yinlong Xu |
Average-Case Performance Analysis of a 2D Strip Packing Algorithm-NFDH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 19-34, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
average-case performance ratio, worst-case performance ratio, approximation algorithm, NP-hard, bin packing |
11 | Ratnabali Biswas, Kaushik R. Chowdhury, Dharma P. Agrawal |
Attribute allocation in large scale sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMSN ![In: Proceedings of the 2nd Workshop on Data Management for Sensor Networks, in conjunction with VLDB, DMSN 2005, Trondheim, Norway, August 30, 2005, pp. 27-33, 2005, ACM, 1-59593-206-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
correlation tree, hard threshold, query dissemination, aggregation, minimum spanning tree, in-network processing, data retrieval, data-centric storage, soft threshold, allocation problem |
11 | David M. Cherba, William F. Punch, Phillip M. Duxbury, Simon J. L. Billinge, Pavol Juhas |
Conformation of an ideal bucky ball molecule by genetic algorithm and geometric constraint from pair distance data: genetic algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, pp. 1565-1566, 2005, ACM, 1-59593-010-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
NP-hard search, bucky ball, spatial crossover, genetic algorithm, molecular conformation |
11 | Alexandr Andoni, Jessica Staddon |
Graceful service degradation (or, how to know your payment is late). ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), Vancouver, BC, Canada, June 5-8, 2005, pp. 9-18, 2005, ACM, 1-59593-049-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
degradation scheme, moderately-hard functions, revocation scheme, copyright protection, broadcast encryption |
11 | Ali El-Haj-Mahmoud, Ahmed S. Al-Zawawi, Aravindh Anantaraman, Eric Rotenberg |
Virtual multiprocessor: an analyzable, high-performance architecture for real-time computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2005 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES 2005, San Francisco, California, USA, September 24-27, 2005, pp. 213-224, 2005, ACM, 1-59593-149-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
worst-case execution time, schedulability analysis, superscalar processor, simultaneous multithreading, hard real-time, resource partitioning |
11 | Paolo Donzelli |
A goal-driven and agent-based requirements engineering framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Requir. Eng. ![In: Requir. Eng. 9(1), pp. 16-39, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Soft and hard goals, UML, Agents, Requirements engineering, Non-functional requirements, Quality models |
11 | Lui Sha, Tarek F. Abdelzaher, Karl-Erik Årzén, Anton Cervin, Theodore P. Baker, Alan Burns 0001, Giorgio C. Buttazzo, Marco Caccamo, John P. Lehoczky, Aloysius K. Mok |
Real Time Scheduling Theory: A Historical Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 28(2-3), pp. 101-155, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
dynamic-priority scheduling, new challenges, feedback, earliest deadline first, fixed-priority scheduling, hard real-time, soft real-time, rate-monotonic scheduling, scheduling models |
11 | Giacomo Bucci, Andrea Fedeli, Luigi Sassoli, Enrico Vicario |
Timed State Space Analysis of Real-Time Preemptive Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 30(2), pp. 97-111, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
nondeterministic time parameters, timeliness predictability, Preemptive Time Petri Nets, reactive systems, multiprocessor schedulability, Hard real-time systems, interprocess communication, preemptive scheduling, state space analysis |
11 | Rodney Turner, Glenn Lowry, Julie Fisher |
A Structural Model of the Information Systems Professional. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Information and Communication Technologies and Real-Life Learning ![In: Information and Communication Technologies and Real-Life Learning, New Education for the Knowledge Society, December 2004, Melbourne, Australia, working conference organised by IFIP Working Group 3.2 (Informatics and ICT in Higher Education) and IFIP Working Group 3.4 (Professional and Vocational Education in Information Technology), pp. 243-253, 2004, Springer, 0-387-25996-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
IS graduates, technical skills, hard skills, Information Systems, structural model, soft skills, IS professional |
11 | Salvatore Cavalieri, Salvatore Monforte, Angelo Corsaro, Giovanni Scapellato |
Multicycle Polling Scheduling Algorithms for FieldBus Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Real Time Syst. ![In: Real Time Syst. 25(2-3), pp. 157-185, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
FieldBus communication networks, hard real-time scheduling, priority scheduling algorithm, earliest deadline first algorithm, rate monotonic algorithm |
11 | Oded Goldreich 0001, Vered Rosen |
On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 16(2), pp. 71-93, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Hard-core predicates, Simultaneous security, Factoring assumption, Discrete logarithm, Pseudorandom generator, Modular exponentiation |
11 | Jakob Engblom, Andreas Ermedahl, Mikael Sjödin, Jan Gustafsson, Hans Hansson |
Worst-case execution-time analysis for embedded real-time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 4(4), pp. 437-455, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Embedded systems, Software architecture, Hard real-time, WCET analysis, Programming tools |
11 | Giacomo Bucci, Andrea Fedeli, Enrico Vicario |
Predicting Timeliness of Reactive Systems under Flexible Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISADS ![In: 6th International Symposium on Autonomous Decentralized Systems (ISADS 2003), 9-11 April 2003, Pisa, Italy, pp. 125-130, 2003, IEEE Computer Society, 0-7695-1876-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
flexible computation, enumerative analysis, Petri nets, validation, hard real time systems, process scheduling, timed behavior |
11 | Vittoria Bruni, Domenico Vitulano |
A Wiener filter improvement combining wavelet domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIAP ![In: 12th International Conference on Image Analysis and Processing (ICIAP 2003), 17-19 September 2003, Mantova, Italy, pp. 518-523, 2003, IEEE Computer Society, 0-7695-1948-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Signal and Image Denoising, Hard-Thresholding, Wavelet Transform, Wiener Filter |
11 | Andreas Ermedahl, Friedhelm Stappert, Jakob Engblom |
Clustered calculation of worst-case execution times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the International Conference on Compilers, Architectures and Synthesis for Embedded Systems, CASES 2003, San Jose, California, USA, October 30 - November 1, 2003, pp. 51-62, 2003, ACM, 1-58113-676-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
WCET calculation, embedded systems, hard real-time, WCET analysis |
11 | Ioannis C. Avramopoulos, Miltiades E. Anagnostou |
Optimal Component Configuration and Component Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 1(4), pp. 303-312, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
component allocation, component mobility, multiterminal cuts, max flow—min cut, mixed binary integer programming, Mobile agents, reconfiguration, NP-hard problems |
11 | Paolo Donzelli, Roberto Setola |
Handling the knowledge acquired during the requirements engineering process: a case study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEKE ![In: Proceedings of the 14th international conference on Software engineering and knowledge engineering, SEKE 2002, Ischia, Italy, July 15-19, 2002, pp. 673-679, 2002, ACM, 1-58113-556-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
soft and hard goals, agents, requirements engineering, process modeling, quality modeling |
11 | Johan Håstad |
Some optimal inapproximability results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(4), pp. 798-859, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
NP-hard optimization problems, max-sat, linear equations, Inapproximability, probabilistically checkable proofs |
11 | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund 0001, Joseph Naor, Baruch Schieber |
A unified approach to approximating resource allocation and scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(5), pp. 1069-1090, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Approximation algorithms for NP-hard problems, scheduling, resource allocation, dynamic storage allocation, general caching |
11 | Carsten Wegener, Michael Peter Kennedy, Bernd Straube |
Process Deviations and Spot Defects: Two Aspects of Test and Test Development for Mixed-Signal Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 17(5), pp. 409-416, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
hard-fault, test pattern selection, soft-fault |
11 | Friedhelm Stappert, Andreas Ermedahl, Jakob Engblom |
Efficient longest executable path search for programs with complex flows and pipeline effects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASES ![In: Proceedings of the 2001 International Conference on Compilers, Architectures and Synthesis for Embedded Systems, CASES 2001, Atlanta, Georgia, USA, November 16-17, 2001, pp. 132-140, 2001, ACM, 1-58113-399-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
pipeline timing, program flow, embedded systems, WCET, hard real-time, path search |
11 | Kang G. Shin, Chih-Che Chou, Seok-Kyu Kweon |
Distributed Route Selection for Establishing Real-Time Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(3), pp. 318-335, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Hard real-time communication systems, real-time channel/connection, deadline guarantees, distributed route selection, message scheduling |
11 | Martin Skutella |
Approximating the single source unsplittable min-cost flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 136-145, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
single source unsplittable min-cost flow problem, common source vertex, destination vertices, edge capacities, virtual-circuit routing, hard cost constraints, computational complexity, load balancing, resource allocation, combinatorial optimization, partitioning, optimisation, processor scheduling, NP-complete problems, packing, hardness, bicriteria approximations |
11 | Maxim Sviridenko, Gerhard J. Woeginger |
Approximability and in-approximability results for no-wait shop scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 116-125, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
in-approximability results, no-wait shop scheduling, makespan criterion, computational complexity, approximability, processor scheduling, polynomial time approximation scheme, polynomial approximation, APX-hard |
11 | Rafail Ostrovsky, Yuval Rabani |
Polynomial Time Approximation Schemes for Geometric k-Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 349-358, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
geometric k-clustering, data point clustering, data set partitioning, high dimensional geometry, binary cube, computational complexity, computational geometry, Hamming distance, NP-hard problem, distance function, polynomial time approximation schemes, pattern clustering, k-median problem |
11 | Jan Lindström, Kimmo E. E. Raatikainen |
Using importance of transactions and optimistic concurrency control in firm real-time databases. ![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. 463-467, 2000, IEEE Computer Society, 0-7695-0930-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
optimistic concurrency control protocol, transaction importance, hard real-time databases, database consistency requirements, heterogeneous transactions, OCC-PDATI, serialization order dynamic adjustment, prototype database system, performance, real-time systems, concurrency control, timing, database management systems, transaction processing, timing constraints, conflict resolution, access protocols |
11 | Enzo Mumolo |
Prediction of Disk Arm Movements in Anticipation of Future Requests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASCOTS ![In: MASCOTS 1999, Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 24-28 October, 1999, College Park, Maryland, USA, pp. 305-312, 1999, IEEE Computer Society, 0-7695-0381-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
disk arm, seek time, prediction, hard disk |
11 | Jakob Engblom, Andreas Ermedahl |
Pipeline Timing Analysis Using a Trace-Driven Simulator. ![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. 88-95, 1999, IEEE Computer Society, 0-7695-0306-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
pipeline analysis, embedded systems, WCET, hard real-time |
11 | Joël Goossens, Raymond R. Devillers |
Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines. ![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. 54-61, 1999, IEEE Computer Society, 0-7695-0306-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
hard real-time scheduling, periodic task set, feasibility interval, Deadline driven scheduler, arbitrary deadline |
11 | Franz Fischer, Annette Muth, Georg Färber |
Towards interprocess communication and interface synthesis for a heterogeneous real-time rapid prototyping environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CODES ![In: Proceedings of the Sixth International Workshop on Hardware/Software Codesign, CODES 1998, Seattle, Washington, USA, March 15-18, 1998, pp. 35-39, 1998, IEEE Computer Society, 0-8186-8442-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
task classification model, rapid prototyping, SDL, hard real-time, communication synthesis |
11 | Jan Jonsson, Kang G. Shin |
A Parametrized Branch-and-Bound Strategy for Scheduling Precedence-Constrained Tasks on a Multiprocessor System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 1997 International Conference on Parallel Processing (ICPP '97), August 11-15, 1997, Bloomington, IL, USA, Proceedings, pp. 158-165, 1997, IEEE Computer Society, 0-8186-8108-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
real-time scheduling precedence-constrained tasks, branch-and-bound strategy, multiprocessor systems, hard real-time systems |
11 | Spyros Tragoudas |
Min-Cut Partitioning on Underlying Tree and Graph Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 45(4), pp. 470-474, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Circuit and network partitioning, NP-hard, iterative improvement |
11 | Chihping Wang, Ming-Syan Chen |
On the Complexity of Distributed Query Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 8(4), pp. 650-662, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
semijoin processing, complexity, distributed databases, NP-hard problems, Distributed query optimization |
11 | Sha Guo, Wei Sun 0002, Mark Allen Weiss |
On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 8(4), pp. 604-616, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
derivability problem, Database, NP-hard, satisfiability, conjunctive queries, implication problem |
11 | Prasad Chalasani, Somesh Jha, Isaac Saias |
Approximate Option Pricing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 244-253, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
approximate option pricing, world financial markets, binomial pricing model, stock price, path-dependent options, #-P hard, deterministic polynomial-time approximate algorithms, perpetual American put option, random walk, random walks, error analysis, Monte Carlo methods, Monte Carlo methods, polynomial time, error bounds, computational problem |
11 | Claire Kenyon, Eric Rémila |
Approximate Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 31-36, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
packing rectangles, NP-hard cutting-stock problem, fractional bin-packing, guillotine cuts, computational complexity, strip-packing |
11 | Alan M. Frieze, Ravi Kannan |
The Regularity Lemma and Approximation Schemes for Dense Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 12-20, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
dense problems, polynomial time approximation, dense graphs, Graph Bisection problem, Min l-way cut problem, Graph Separator problem, Max-SNP hard problems, graph theory, approximation schemes, Quadratic Assignment Problem, regularity lemma, Max Cut problem |
11 | Jon M. Kleinberg |
Single-Source Unsplittable Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 68-77, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
max-flow min-cut, scheduling, load balancing, generalization, NP-hard, unsplittable flow, machine scheduling, capacity constraints |
11 | Stephen Docy, Inki Hong, Miodrag Potkonjak |
Throughput Optimization in Disk-Based Real-Time Application Specific Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSS ![In: Proceedings of the 9th International Symposium on System Synthesis, ISSS '96, San Diego, CA, USA, November 6-8, 1996., pp. 133-138, 1996, ACM / IEEE Computer Society, 0-8186-7563-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Massive Storage, Hard Real-Time, System-Level Synthesis |
11 | Almut Burchard, Jörg Liebeherr, Yingfeng Oh, Sang Hyuk Son |
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 44(12), pp. 1429-1442, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
task assignment scheme, multiprocessor systems, Hard real-time systems, periodic tasks, rate-monotonic scheduling |
11 | Jin-yi Cai, D. Sivakumar |
The Resolution of a Hartmanis Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 362-371, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Hartmanis conjecture, sparse sets, logspace many-one reductions, sparse hard set, computational complexity |
11 | Sanjeev Arora |
Reductions, Codes, PCPs, and Inapproximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 404-413, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
NP-hard functions, code-like Levin reduction, complexity assumption, positive fraction, 3-colorable graph, code-like reduction, computational complexity, graph theory, error correction codes, error-correcting codes, NP-hardness, codes, inapproximability, PCPs, hardness, approximation ratio |
11 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 62-71, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm |
11 | Martin Fürer |
Improved Hardness Results for Approximating the Chromatic Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 414-421, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
hardness results, chromatic number approximation, geometric proof, randomized twisting method, amortized free bits, polynomial lower bounds, computational complexity, graph theory, NP-hard, polynomial time algorithm, chromatic number |
11 | Mark G. Karpovsky, Lev B. Levitin, Feodor S. Vainstein |
Diagnosis by Signature Analysis of Test Responses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(2), pp. 141-152, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
faulty processing elements, compressed test response, space-time signature, hard decision decoding, space-time compression, parallel processing, fault tolerant computing, logic testing, fault location, array processors, signature analysis, test responses |
11 | Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni |
Deleting Vertices to Bound Path Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(9), pp. 1091-1096, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
vertex deletion problem, path length bound, weighted directed acyclic graphs, quadratic time, computational complexity, directed graphs, NP-hard problems, linear time, series-parallel graph, rooted tree |
11 | Bing-rung Tsai, Kang G. Shin |
Assignment of Task Modules in Hypercube Multicomputers with Component Failures for Communication Efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(5), pp. 613-618, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
task modules, indirect optimization, communication turnaround time, optimization, performance measure, hypercube networks, telecommunication traffic, communication cost, fault-tolerant routing, task assignment, NP hard problem, link failures, hypercube multicomputers, communication efficiency, component failures, communication traffic |
11 | Carsten Lund, Mihalis Yannakakis |
On the Hardness of Approximating Minimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(5), pp. 960-981, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
clique cover, approximation algorithms, NP-hard, graph coloring, dominating set, set cover, independent set, chromatic number, probabilistically checkable proofs, hitting set |
11 | Eileen Tien Lin, Edward Omiecinski, Sudhakar Yalamanchili |
Large Join Optimization on a Hypercube Multiprocessor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(2), pp. 304-315, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
large join optimization, parallel large join plan, initial solution, iterative local-improvement method, Intel iPSC/2 hypercube machine, performance, computational complexity, parallel programming, query processing, relational database, heuristics, simulated annealing, optimisation, iterative methods, hypercube networks, relational algebra, heuristic programming, NP-hard problem, hypercube multiprocessor, problem complexity, inherent parallelism, large join queries |
11 | R. Ravi 0001 |
Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 202-213, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
minimum gossip time problem, rapid rumor ramification, minimum broadcast time approximation, minimum broadcast time problem, telephone model, multicast problem, NP-complete, NP-hard, undirected graph, conference calls |
11 | Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 780-791, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
added edges, parameterized completion problems, minimum fill-in, NP-Hard graph completion problem, interval graphs, parameterized complexity, tractability, vertex coloring, physical mapping |
11 | S. Rao Kosaraju, James K. Park, Clifford Stein 0001 |
Long Tours and Short Superstrings (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 166-177, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
shortest-superstring problem, short superstrings, long tours, weight-maximizing variants, weight-minimizing counterparts, nontrivial approximation algorithms, directed graphs, traveling-salesman problems, undirected graphs, MAX SNP-hard |
11 | Noga Alon, Alan M. Frieze, Dominic Welsh |
Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 24-35, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
polynomial time randomised approximation schemes, dense graphs, Tutte-Grothendieck polynomial, combinatorial quantities, spanning forests, strongly connected orientations, k-colorings, reliability probability, P-hard, ferromagnetic Q-state Potts model, linear matroids, weight enumerator, linear codes, partition functions, Tutte polynomial |
11 | David Hung-Chang Du, Ichiang Lin, K. C. Chang 0001 |
On Wafer-Packing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(11), pp. 1382-1388, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
wafer-packing problems, multiple chip designs, fabrication cost, VLSI, NP-hard, heuristic algorithms, VLSI design, multichip modules, polynomial-time solvable |
11 | Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel |
Gossigping in a Distributed Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(2), pp. 253-256, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
radio links, computational complexity, distributed algorithm, distributed algorithms, NP-hard, gossiping, distributed network, broadcast networks, point-to-point networks |
11 | Edward P. F. Chan |
A Possible World Semantics for Disjunctive Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 5(2), pp. 282-292, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
ground atom, disjunctive database, generalized closed world assumption, GCWA, disjunctive database rule, DDR, PWS, propositional databases, negative ground literal, co-NP-hard, knowledge based systems, database theory, deductive databases, database semantics, possible world semantics, negative information |
11 | Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk |
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 724-733, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
approximate optima, NP-hard, lattices, codes, polynomial time algorithm, linear equations, interactive proof systems, hardness, set-cover problem, binary codes |
11 | Douglas M. Blough, Andrzej Pelc |
Complexity of Fault Diagnosis in Comparison Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(3), pp. 318-324, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
ault diagnosis, comparison models, comparison-based probabilistic model, optimal diagnosis, asymmetric comparison model, ring systems, computational complexity, grids, fault tolerant computing, multiprocessor, hypercubes, multiprocessing systems, NP-hard, fault location, bipartite graphs, linear-time algorithm, forests |
|
|