Harel, D., 1987. Algorithmics: The Spirit of Computing, Reading: AddisonWesley. Harman, G., 1973. Thought, Princeton: Princeton University Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....overhead being prohibitively expensive. 3. 5 Ultimate sharing and related concepts in the literature The idea of improving the e#ciency of an algorithm by reusing previously computed results is, of course, by no means new this is just the philosophy behind dynamic programming (see e.g. Har87] However, when the algorithm to be improved is one for implementing a functional language we so to speak step up one level, since to make this particular algorithm faster (for some inputs) amounts to making many programs faster. Concepts resembling ultimate sharing seem to have come up rather ....

....operations (addition, subtraction, multiplication, division and equality test) are assigned unit cost, the model collapses in the sense that e.g. complete factorization of a number n can be done in time O(log n) Knu81, p. 398] Consider the well known Towers of Hanoi problem (see e.g. Har87] which in a logic language can be solved by the program hanoi(1,A,B,C, mv(A,B) L] L) hanoi(s(N) A,B,C,L S) hanoi(N,A,C,B,L1 S1) hanoi(N,C,B,A,L2 S2) append(L1 S1, mv(A,B) L2] S2,L S) append(L1 L2,L2 L3,L1 L3) 112 where we use the technique of di#erence lists (see e.g. ....

David Harel. Algorithmics - The Spirit of Computing. Addison-Wesley, 1987.

....improve the performance of the design. Therefore, it will not be beneficial to carry out further design time scalability analysis for that design. The component scalability assumption we use are based on understandings of the design and standard computer science theory of algorithms (e.g. see [14]) For example, we make assumptions about how the response time of database search algorithms will scale with an increase load. For causal analysis, we analyze the component response times for each model component. We then compare time spent in different components. Using this comparison and ....

D. Harel, Algorithmics: The Spirit of Computing, Addison-Wesley Publishing Company, Wokingham, England, 1987.

.... of deciding, given a set T of domino types, a natural number m (written in unary) and two domino types d init ; d nal 2 T , whether there exists a natural n s :t : the n grid can be tiled, with the additional conditions that f(0; 0) d init and f(2 1; n 1) d nal , is EXPSPACE complete [9]. Let I = C; T ; m; d init ; d nal ) be such an instance. We build a Kripke structure K I as follows: fb 1 ; b m ; b 1 ; b m g are 2m atomic propositions, that we will use to encode the value of a m bits counter numbering the cells of one line of the grid. Each domino type d ....

D. Harel. Algorithmics: The Spirit of Computing. AddisonWesley, 2nd edition, 1992.

....by passing the parameter to the neighboring student, who is also required to execute the same 1 Note that an iterative program for computing Fibonacci numbers is more e#cient than the recursive one. Note also that even the Towers of Hanoi problem has an iterative solution See [1] or [3], p. 115. # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # Figure 1: A present algorithm exactly as it is displayed. The calling student is required to wait for the termination of the student executing the recursive call, clearly showing the di#erence ....

David Harel. Algorithmics: the Spirit of Computing (Second Edition). Addison-Wesley, Reading, MA, 1992.

....science theory, social issues, and communication skills. Teaching a sequence of courses with such a broad set One of the first hurdles we faced was selecting textbooks that would aid us with our objectives. The set of texts that we currently use include: ffl Algorithmics: The Spirit of Computing [Harel 1992]. This book discusses fundamental ideas of computer science. ffl Data Structures and Algorithm Analysis [Weiss 1992] This book introduces the concept of an ADT, its underlying implementations, and their analysis. ffl Discrete Algorithmic Mathematics [Maurer and Ralston 1991] ffl ....

Harel 1992. Harel, D. Algorithmics: The Spirit of Computing. Addison-Wesley Publishing Company. Hartmanis 1992. "Computing the Future." Communications of the ACM, 35(11):30-40, November 1992.

....in the previous experiments. After reviewing the descriptions, depictions and examples of the BubbleSort and SelectionSort algorithms contained in 19 textbooks published between 1974 and 1997 [Aho Hopcroft Ullman 1974; 1983; Baase 1988; Dale Lilly McCormick 1996; Delillo 1993; Hansen 1983; Harel 1992; Hillam 1994; Horowitz Sahni 1976; Kingston 1990; Korsch 1986; Kozen 1992; Manber 1989; Nance Naps 1995; Rowe 1997; Sedgewick 1988; Shaffer 1997; Singh Naps 1985; Weiss 1993] we selected the three best explanations we could find. These explanations were then edited to increase clarity and ....

Harel, D. (1992). Algorithmics: The Spirit of Computing. Reading, MA: Addison-Wesley.

....probabilistic reasoning, and controlling machinery) Boddy [3] discusses a method for constructing anytime procedures for solving dynamic programs. ffl Probablistic algorithms One family of probabilistic algorithms that can easily be adapted for anytime use are Monte Carlo algorithms [20]. ffl Probabilistic inference A wide variety of methods has been developed for approximate evaluation of belief nets (i.e. providing bounds on the posterior distribution, rather than the exact distribution) Several of these methods are anytime algorithms in the sense that the bounds get ....

Harel, David, ALGORITHMICS: The Spirit of Computing, (Addison-Wesley, 1987).

....time after the arrival of the corresponding input (or set of inputs) Thus, for example, it may be crucial for an application that each input be operated on as soon as it is received. Similarly, each partial solution (as well as the final one) may need to be returned as soon as it is available [32, 40, 56]. It is helpful to note here that, when no deadlines are imposed, computations for which inputs arrive while the algorithm is in progress are referred to as on line [27, 33, 35, 36] incremental [21, 22, 49, 59] dynamic [11, 12, 67] and updating [20, 23, 28, 38, 53, 54, 62, 66] It is also ....

D. Harel, Algorithmics: The Spirit of Computing , Addison Wesley, Reading, Massachusetts, 1987.

....false: Theoretical Considerations Complexity Again we do not give a detailed analysis of complexity of performing step resolution. However, as step resolution is similar to classical propositional resolution we note that satisfiability for classical propositional logic is an NP complete problem [Har87, Hak85] and therefore detecting propositional tautologies (a problem equivalent to recognising the unsatisfiablity of the negation of formulae) is co NP complete [Hak85] 2.2.3 Temporal Resolution The temporal resolution process consists of (possibly multiple) applications of the temporal ....

D. Harel. Algorithmics: The Spirit of Computing. Addison-Wesley, 1987.

....time after the arrival of the corresponding input (or set of inputs) Thus, for example, it may be crucial for an application that each input be operated on as soon as it is received. Similarly, each partial solution (as well as the final one) may need to be returned as soon as it is available [31, 39, 55]. It is helpful to note here that, when no deadlines are imposed, computations for which inputs arrive while the algorithm is in progress are referred to as on line [26, 32, 34, 35] incremental [20, 21, 48, 58] dynamic [10, 11, 66] and updating [19, 22, 27, 37, 52, 53, 61, 65] It is also ....

D. Harel, Algorithmics: The Spirit of Computing , Addison Wesley, Reading, Massachusetts, 1987.

....times during the week. They are also available for much of the week through e mail. Required texts The two accelerated courses effectively cover the material from seven other courses, and so we require four texts, that are used throughout the two courses. They are books on Unix [9] algorithmics [4], mathematical structures [3] and C [2] Fall CS 252 Accel. Intro. to CS I 5 Math 181 Calculus I 4 Year 1 Spr. CS 254 Accel. Intro. to CS II 5 CS 350 Thy. of Computation 3 CS 355 Design of Prog. Lang. 3 Sum. Math 182 Calculus II 4 Fall CS 425 Computer Graphics 3 CS 418 Operating Systems 3 CS ....

Harel, D.H., Algorithmics: The Spirit of Computing. Addison-Wesley, 1992.

....of outputs) must be returned within a certain time after its computation. Thus, for example, it may be crucial for an application that each input be operated on as soon as it is received. Similarly, each partial solution (as well as the final one) may need to be returned as soon as it is available [21, 28, 37]. It is helpful to note here that, when no deadlines are imposed, computations for which inputs arrive while the algorithm is in progress are referred to as on line [18, 22, 23, 24] incremental [14, 15, 32, 39] dynamic [7, 8, 44] and updating [13, 16, 19, 26, 34, 35, 41, 43] 2.2 Real time ....

D. Harel, Algorithmics: The Spirit of Computing , Addison Wesley, Reading, Massachusetts, 1987.

....reasonable BSc degree in a numerate subject. Year Conversion course MSc. Prerequisites Some exposure to imperative programming. Textbooks For the part of the course we are here describing in this paper, the textbook is Bird and Wadler [1] For the complexity aspects, we subsequently use Harel [6]. Timetable The course lasts nine weeks. number of times duration per total duration per week session per week lecture hours 1 1.5 1.5 laboratories 1 2.5 2.5 Assessment The students are assessed by a two hour written examination (counting for 75 of the marks) and by four assessed practicals ....

D Harel. Algorithmics: the Spirit of Computing. Addison-Wesley, 1987.

.... can even be extended to the student whose major minor is Computer Science by offering a second block course that covers computer science in general (e.g. the approach taken by Brookshear s text [1] or algorithms independent of an implementation language (e.g. the approach taken by Harel in [7]) This course sequence would then be taken either prior to or concurrently with a CS1 offering. Certainly the material from the CS0 a and a CS0 b block courses can be combined into a one semester long course. The advantages of separation are that a student can take, when appropriate, multiple ....

David Harel. Algorithmics: The Spirit of Computing. Addison Wesley Publishing, 1992.

....a hypernode of type NAT containing ONE as its single node, and so forth. In [27] we use this representation of the natural numbers to prove that Hyperlog is computationally complete. In particular, we show that Hyperlog can simulate counter programs which are known to be computationally complete [17]. In that paper we also show that Hyperlog is update complete [1] 6 Implementation Figure 9 shows the architecture of our current Hyperlog implementation. The Database (DB) Browser Display Generator, Evaluator and Translator modules are implemented in the functional database programming ....

D.Harel, Algorithmics - The Spirit of Computing. Addison-Wesley, Reading, Ma., 1987.

....the performance of the design. Therefore, it will not be beneficial to carry out further design time scalability 12 analysis for that design. The component scalability assumption we use are based on understandings of the design and standard computer science theory of algorithms (e.g. see [14]) For example, we make assumptions about how the response time of database search algorithms will scale with an increased load. For causal analysis, we analyze the component response times for each model component. We then compare time spent in different components. Using this comparison and ....

D. Harel, Algorithmics: The Spirit of Computing, Addison-Wesley Publishing Company, Wokingham, England, 1987.

No context found.

Harel, D., Algorithmics: The Spirit of Computing , Addison-Wesley, 1987 (2nd Edition, 1992).

.... computability, formal languages and automata, and program verification can be found in [Shoenfield, 1967] logic) Rogers, 1967] recursion theory) Kozen, 1997a] formal languages, automata, and computability) Keisler, 1971] infinitary logic) Manna, 1974] program verification) and [Harel, 1992; Lewis and Papadimitriou, 1981; Davis et al. 1994] computability and complexity) Much of this introductory material as it pertains to DL can be found in the authors text [Harel et al. 2000] There are by now a number of books and survey papers treating logics of programs, program ....

D. Harel. Algorithmics: The Spirit of Computing. Addison-Wesley, second edition, 1992.

.... is there a T snake connecting the points (0, 0) and (k, 0) and lying entirely within the fixed width rectangle These problems are the snake versions of classical bounded tiling problems, i.e. the square tiling problem, the rectangle tiling problem and the fixed width tiling problem (see e.g. [8, 11]) The complexity of Problems 2.2 and 2.3 was investigated in [3] In analogy with the square tiling problem and the rectangle tiling problem which are NP and PSPACE complete, respectively, we have the following theorem. Theorem 2.5 (Ebbinghaus [3] Problem 2.2 is NP complete; Problem 2.3 is ....

....a fixedwidth rectangle (Problem 2.4) This problem admits a polynomial time algorithm that is based on a reduction to a polynomial time procedure for checking the existence of a tiling of a fixed width rectangle. Hence, we first include a polynomial time algorithm (whose existence was mentioned in [8]) for the latter case. 250 Y. Etzion Petruschka et al. Problem 2.6 (Tiling afixed width rectangle) Let k be a fixed natural number that is not part of the input. Given a tiling system T and n (in unary) is there a T tiling of the fixed width rectangle Pkn Theorem 2.7. Problem 2.6 admits a ....

D. Harel, Algorithmics: The Spirit of Computing (Addison-Wesley, Reading, MA, 1987.

No context found.

Harel, D., 1987. Algorithmics: The Spirit of Computing, Reading: AddisonWesley. Harman, G., 1973. Thought, Princeton: Princeton University Press.

No context found.

D. Harel, Algorithmics: The Spirit of Computing , Addison Wesley, Reading, Massachusetts, 1987.

No context found.

Harel, D., 1987. Algorithmics: the Spirit of Computing. Addison-Wesley, Wokingham, England.

No context found.

Harel, D., 1987. Algorithmics: the Spirit of Computing. Addison-Wesley, Wokingham, England.

No context found.

D. Harel, "Algorithmics: The Spirit of Computing," Addison-Wesley Publishing Company, Inc., 1987.

No context found.

D. Harel, "Algorithmics: The Spirit of Computing," Addison-Wesley Publishing Company, Inc., 1987.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC