| |
 |
|
|
Bovet, Daniel
University of Rome
Rome, Italy
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 13
reviews
|
|
|
|
|
|
|
|
Recontamination does not help to search a graph
LaPaugh A. Journal of the ACM 40(2): 224-245, 1993. Type: Article
Lapaugh proves the truth of a conjecture raised by Megiddo et al. [1] that the edges of a graph can be cleared by an efficient one-pass algorithm without ever having to reclear an edge already cleared. This places the graph-searching p...
|
Sep 1 1994 |
|
|
|
|
|
|
Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
Kellerer H. Computing 46(3): 183-191, 1991. Type: Article
Consider the problem of scheduling independent jobs nonpreemptively on a multiprocessor system to minimize the makespan. Among the heuristics proposed for this NP-complete problem, Graham has considered the longest processing time (LPT...
|
Sep 1 1993 |
|
|
|
|
|
|
Dynamic adaptation of real-time software
Bihari T., Schwan K. ACM Transactions on Computer Systems 9(2): 143-174, 1991. Type: Article
The objective of RESAS (Real-time Software Adaptation System) is to provide the tools necessary for programmers to implement and enact adaptations in real time. For that purpose, it includes adaptation algorithms capable of modifying t...
|
Jun 1 1992 |
|
|
|
|
|
|
Optimal Distributed t-Resilient Election in Complete Networks
Itai A., Kutten S., Wolfstahl Y., Zaks S. IEEE Transactions on Software Engineering 16(4): 415-420, 1990. Type: Article
This short paper considers the problem of distributed leader election in an asynchronous complete network. By properly extending an algorithm described in Humblet [1], the authors succeed in designing a distributed algorithm that finds...
|
Mar 1 1991 |
|
|
|
|
|
|
Minimal threshold separators and memory requirements for synchronization
Ordman E. SIAM Journal on Computing 18(1): 152-165, 1989. Type: Article
This paper concentrates on a class of mutual exclusion problems, namely those for which process requests can be expressed as threshold graphs. Threshold graphs G(V,E) are characterized by a labeling of the vertices...
|
Mar 1 1990 |
|
|
|
|
|
|
Many hard examples for resolution
Chvátal V., Szemerédi E. Journal of the ACM 35(4): 759-768, 1988. Type: Article
Given two clauses (sets of literals) A and B and a variable x such that x ∈ A and &xmacr; ∈ B, clause ( ( A − { x &...
|
Jul 1 1989 |
|
|
|
|
|
|
Reachability trees for high-level Petri nets
Huber P., Jensen A., Li ., Jepsen L., Jensen K. (ed) Theoretical Computer Science 45(3): 261-292, 1986. Type: Article
High-level Petri nets (HL-nets) have been introduced to handle rather complex systems in a succinct and manageable way, although there is still much work to be done in order to establish the necessary analysis methods....
|
Feb 1 1989 |
|
|
|
|
|
|
Stability and distributed scheduling algorithms
Stankovic J. (ed) IEEE Transactions on Software Engineering SE-11(10): 1141-1152, 1985. Type: Article
Distributed systems are composed of several processing nodes connected by communication links. The main issue investigated in this paper is the stability of distributed scheduling algorithms....
|
Sep 1 1988 |
|
|
|
|
|
|
Slowing down sorting networks to obtain faster sorting algorithms
Cole R. Journal of the ACM 34(1): 200-208, 1987. Type: Article
As clearly stated by the author, the paper presents an “improvement of Megiddo’s ingenious technique [1], which uses an efficient parallel algorithm for one problem to produce an efficient serial algorithm for a sec...
|
Oct 1 1987 |
|
|
|
|
|
|
Authoring: a guide to the design of instructional software
Kearsley G. (ed), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986. Type: Book (9789780201117318)
The author states in the Preface: “This is not a how-to book. It does not tell you the steps to follow in order to create good instructional programs. It is a style guide that tells you what principles to follow and what to a...
|
Apr 1 1987 |
|
|
|
|
|
| |
|
|
| |
|
|
