J. v. Leeuwen, editor. Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science. Elsevier Science Publishers B.V., 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....then ITPU(p2,T r, r]r, r, 2, 4]r, 2 ) then itn final tentative assignment ]2, 212, 2, 4] r, Note we have not discovered all unit clause conse 3. 1 Binary Resolution Closure We can detect more unit clause consequences by computing the resolution closure of the binary clause in formation [Leeuwen, 1990], and thus possibly discover more variables whose values must be fixed by the binary clause sub problem. Resolution closure on the binary clauses, ensures that all binary consequences of the binary clauses appear explicitly in the theory T. This may be able to detect literals that must be true, ....

Leeuwen, J. V. (1990). Handbook of theoret- ical computer science. volume A, pages 539-542.

....f[p 1 ] 2 ; p 2 ] 2 ; p 3 ] 2 ; p 4 ] 1 ; p 5 ] 2 g) Note we have not discovered all unit clause consequences of T 1 [ f[p 5 p 2 ]g. 3. 1 Binary Resolution Closure We can detect more unit clause consequences by computing the resolution closure of the binary clause information [Leeuwen, 1990], and thus possibly discover more variables whose values must be xed by the binary clause sub problem. Resolution closure on the binary clauses, ensures that all binary consequences of the binary clauses appear explicitly in the theory T . This may be able to detect literals that must be true, ....

Leeuwen, J. V. (1990). Handbook of theoretical computer science. volume A, pages 539-542.

....Formal methods have a long history. Some techniques for proving the correctness of programs were outlined in the late 1940 s by Turing [Tur49] MJ84] and von Neumann [GvN47] Since then, many different logics, formal languages and calculi have been developed by a large number of researchers [vL90, chapters 13 16,19] However, acceptance of formal methods by the software industry has been slow, for a variety of reasons. One technical reason is that formal methods, particularly refinement methods, do not always scale up to large problems easily. The formal method used here is the ....

Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B. Elsevier, 1990. Formal Models and Semantics. Ref. on page 1.

....role are distributed by nature [19, 68] distributed models are likely to 9 play an important role in the future research in mechanism design. 59] is a comprehensive book on this topic. The theory of cryptography is concerned with communication and computation in the presence of adversaries [110][chapter 13] Cryptographic protocols can ensure properties like privacy [88] authentication [28] and well behavior of the participants [6] As information ow can greatly in uence the agents strategy space and because much of the applications of mechanism design involve a lot of money, ....

Jean Van Leeuwen, editor. Handbook of Theoretical Computer Science. Mit Press, 1990.

....on problems in several different areas simultaneously, enriching the discipline by applying ideas from one area to another. A good contemporary example is the cross fertilization between cryptography and structural complexity theory. The recently published Handbook of Theoretical Computer Science [7] contains comprehensive surveys of all aspects of theoretical computer science of current interest. The current topics go beyond deterministic, sequential computing. Parallel and probabilistic computation have been studied for many years, but now there are many efforts on ffl randomized, ....

J. van Leeuwen, ed., Handbook of Theoretical Computer Science, two volumes, M.I.T. Press, Cambridge, Mass., 1990.

....then the instruction is valid, and it may be used to cover the nodes of the Split Node DAG. Verifying instruction validity through constraint checking is an NP complete problem. It contains the problem of matching regular expressions with back referencing which has been proven to be NP complete [55]. Regular expressions with back referencing are expressions that allow variable matching to be expressed. This means that in order to match such expressions all instances of a given variable must match the same substring. Although constraint checking is NP complete it must be solved exactly; thus, ....

J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity. The MIT Press/Elsevier, 1990.

....them can be completed to a simple cycle in G. This could be done using standard BFS techniques (see, e.g. Eve79] ConstructPartition then finds maximum matchings in the end node graphs. Efficient algorithms for finding maximum matchings in graphs can be found in, e.g. MV80] for a survey see [vL90] pages 580 588) Last, the construction of the equivalent subgraph partition is straightforward. The function AdjustPartition partitions every virtual path and virtual cycle in the subgraph partition using the function Partition. After the partition, every virtual path is plain and can be ....

.... in the ring physical topology case, every plain virtual path can be completed to a plain virtual cycle, thus the relation Q can be simplified to Q(c 1 ; c 2 ) disjoint(c 1 ; c 2 ) The end node graphs are bipartite, and finding maximum matchings in bipartite graphs is considerably easier ( vL90] Also, to find a disjoint path between the endpoints of a given simple path is trivial. In any case, for the applications of RPA for designing optical networks time efficiency is not crucial since the algorithm is applied only in the design stage of the network and it is reasonable to invest ....

J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume A, chapter 10. The MIT Press, 1990.

....Background In this section we provide an introduction to the most basic type of Kolmogorov complexity. We cover only the essential ideas and useful facts to be used in the applications we present later. The mathematical theory of Kolmogorov complexity extends far beyond our presentation here (see [17] and [9] for a more complete treatment) We are interested in defining the complexity of a concrete individual finite string of zeros and ones. Unless otherwise specified all strings will be binary and of finite length. All logarithms in this paper are base 2. If x is a string, then jxj denotes ....

J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume A, chapter 4, pages 187--254. Elsevier/MIT Press, 1990.

....that Omega Gamma N log N) is a lower bound just by determining the points belonging to the convex hull, not necessarily producing them in cyclic order. This lower bound was proved for a decision tree model with quadratic tests, which accommodates all the known planar convex hull algorithms ([10]) 4 Deterministic algorithms for the planar convex hull problem There is a strong analogy between the convex hull problem and the sorting problem (for the convex hull, we will have to think of all given points as points on the hull) In this section we will present the ideas for some of the ....

J. van Leeuwen (managing editor). Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. MIT Press, 1990.

....except at their endpoints. A graph is planar if it is embeddable in the plane. Using the stereographic projection, it is easily shown that a graph is planar if and 5 only if it is embeddable on the sphere. For a more thorough coverage of planar graphs, see any text on graph algorithms, e.g. [19]. For node v of a digraph we let deg (v) and deg Gamma (v) denote its out and indegree, respectively. A vertex v is a source if deg Gamma (v) 0, and a sink if deg (v) 0. We are now ready to define the class of graphs studied in this paper. The terminology is somewhat awkward ....

J. van Leeuwen, Graph algorithms, Algorithms and complexity (J. van Leeuwen, ed.), Handbook of theoretical computer science, vol. A, Elsevier, Amsterdam, 1990, pp. 525--631.

....network with O(log ) more capacity on the edges is O(log n log M) competitive. The second stage of the algorithm. In the second stage all the vertices of the tree are partitioned into O(log n) different classes, by recursively finding a balanced tree separator. A balanced tree separator [22] is a vertex whose removal splits the tree into pieces of at most 2 3 n vertices. 16 The tree separator of T is assigned level 0. Removing the level 0 node splits T into subtrees of level 1. In general, the tree separators of the level j trees are assigned level j and removing them creates ....

Jan van Leeuwen ed. Handbook of theoretical computer science, Vol A, Algorithms and Complexity. The MIT Press, 1990.

....d 2 log 1 Gammaffi m , unless NP RQP, the class of random quasi polynomial time algorithms. Chapter 1. Introduction 22 1.5 Notes The ideas developed at the beginning of Section 1.1 were taken from [LP98, Section 7. 4] and [Gol98, Chapter 2] Other complexity theory references are [vLe90, Volume A] HU79] and [Pap94] Another cryptography reference is [Lub96] Parts of [Gol98] can also be found as [Gol99] Some parts of Section 1.2 borrowed ideas from [Odl90] The greater part of the discussion of the solved instances of SS in Section 1.2.2 was taken from [IN96] A proof of ....

J. van Leeuwen editor. Handbook of Theoretical Computer Science. MIT Press, Cambridge, Mass., 1990.

....successive actions of crossover, inversion and mutation. It has been used to solve a wide range of different problems from vision systems for image classification to gas pipeline flow control systems [5] The travelling salesman problem is a well known member of the NP Complete class of problems [6]. Over the last number of years it has returned to prominence with research conducted on providing near optimal solutions to large TS problems by Fogel [7, 3] and Lawler [8] Although these GA s have undergone some alterations, in particular to the techniques of the crossover, selection [9] and ....

J. Leeuwen, Handbook of Theoretical Computer Science, (Cambridge USA: MIT Press, 1990).

No context found.

J. v. Leeuwen, editor. Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science. Elsevier Science Publishers B.V., 1990.

No context found.

J. V. Leeuwen, editor. Handbook of Theoretical Computer Science, Volume A. Elsevier, 1990. 8

No context found.

J. Leeuwen, editor. Handbook of Theoretical Computer Science, volume B. MIT Press, 1994.

No context found.

J. V. Leeuwen, editor. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. Elsevier and MIT Press, 1990.

No context found.

J. v. Leeuwen, editor. Handbook of Theoretical Computer Science, Vol. B. Elsevier Science Publishers, 1990.

No context found.

J. V. Leeuwen (Ed.): Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. Elsevier and MIT Press. 1990.

No context found.

Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier Science Publishers B.V., Amsterdam, 1990.

No context found.

J. van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier Science Publishers B.V., Amsterdam, 1990.

No context found.

J. van Leeuwen, editor. Handbook of Theoretical Computer Science. Elsevier Science Publishers B.V. (North-Holland), 1990.

No context found.

J. van Leeuwen, editor. Handbook of Theoretical Computer Science. Elsevier Science Pub, 1990.

No context found.

Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier Science Publishers B.V., Amsterdam, 1990.

No context found.

J. van Leeuwen. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier Science Publishers B. V., 1990.

First 50 documents  Next 50

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