SearchBrowse

close this section of the libraryftp://ftp.cs.ruu.nl (50)
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1992/1992-12.ps.gz, 19931118
A Tourist Guide through Treewidth Hans L. Bodlaender Department of Computer Science, Utrecht University P.O.Box 80.089, 3508 TB Utrecht, the Netherlands
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-39.ps.gz, 19931207
Linear Election for Oriented Hypercubes Gerard Tel Department of Computer Science, University of Utrecht, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. Email: gerard@cs.ruu.nl
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-27.ps.gz, 19931214
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs Hans L. Bodlaendery Ton Kloksz
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-38.ps.gz, 19931214
Motion Planning Using A Colored Kohonen Network Jules M. Vleugels Joost N. Kok Mark H. Overmars
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1992/1992-27.ps.gz, 19931214
A linear time algorithm for finding tree-decompositions of small treewidth Hans L. Bodlaendery Department of Computer Science, Utrecht University P.O. Box 80.089, 3508 TB Utrecht, the Netherlands
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-40.ps.gz, 19931214
Basic Process Algebra with Iteration: Completeness of its Equational Axioms Willem Jan Fokkink CWI Hans Zantemay Utrecht University
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-41.ps.gz, 19931214
Simple Termination Revisited Aart Middeldorp Institute of Information Sciences and Electronics University of Tsukuba, Tsukuba 305, Japan e-mail: ami@softlab.is.tsukuba.ac.jp Hans Zantema Department of Computer Science, Utrecht University P.O. Box 80.089, 3508 TB Utrecht, The Netherlands e-mail:
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-46.ps.gz, 19931222
Multi-traversal tree decoration in a functional setting: monads versus bindings Maarten Pennings RUU-CS-93-46 December 1993 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 Multi-traversal tree decoration in a
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-43.ps.gz, 19940111
Manipulating Algebraic Parts in the Plane Anil S. Rao and Kenneth Y. Goldberg RUU-CS-93-43 December 1993 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 Manipulating Algebraic Parts in the Plane Anil S. Rao and
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-21.ps.gz, 19940111
J. T. Schwartz and M. Sharir. On the two-dimensional Davenport-Schinzel problem. Journal of Symbolic Computation, 10:37193, 1990. E. Szemeredi. On a problem by Davenport and Schinzel. Acta Arithmetica, 25:21324, 1974. S. Wolfram. Mathematica. Addison-Wesley, 2nd edition, 1991. 22
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-17.ps.gz, 19940111
E. Rich. Artificial Intelligence. series in AI. McGraw Hill, New York, 1983. S. S. Skiena. Geometric probing. PhD thesis, University of Illinois, Dept. of Computer Science, Urbana, Ill., 1988. S. S. Skiena. Problems in geometric probing. Algorithmica, pages 59905, 1989. A. J.
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-16.ps.gz, 19940111
A. S. Rao and K. Y. Goldberg. Orienting generalized polygonal parts. In International conference on Robotics and Automation (ICRA), Nice, France, May 1992. IEEE. A. S. Rao and K. Y. Goldberg. Shape from diameter: Positive results. Technical Report RUU-CS-93-17, Utrecht University, Department
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-02.ps.gz, 19940111
Trekking in the Alps Without Freezing or Getting Tired Mark de Bergy Marc van Kreveldy
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1991/1991-39.ps.gz, 19940111
On the complexity of the Maximum Cut problem Hans L. Bodlaender Klaus Janseny
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-10.ps.gz, 19940112
Detecting the Erosion of Hierarchic Information Structures P.D. Bruza y T.W.C. Huibers J. van der Linden z T. van Opstalz
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1991/1991-08.ps.gz, 19940112
Network Orientation Gerard Tel Department of Computer Science, University of Utrecht, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands (Email: gerard@cs.ruu.nl)
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-30.ps.gz, 19940112
Unravelling Nondeterminism: On Having the Ability to Choose W. van der Hoek B. van Linder J.-J. Ch. Meyery Utrecht University Department of Computer Science P.O. Box 80.089, 3508 TB Utrecht The Netherlands Email: bernd@cs.ruu.nl
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-07.ps.gz, 19940113
On the Relation Between Unity Properties and Sequences of States R.T. Udink and J.N. Kok RUU-CS-93-07 February 1993 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 On the Relation Between Unity Properties and
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz, 19940125
Reaching a Goal with Directional Uncertainty Mark de Berg Leonidas Guibas Dan Halperin Mark Overmars Otfried Schwarzkopf Micha Sharir Monique Teillaud UU{CS{1994{09 January 1994 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-08.ps.gz, 19940125
Tests as Epistemic Updates Pursuit of Knowledge B. van Linder W. van der Hoek J.-J. Ch. Meyery Utrecht University Department of Computer Science P.O. Box 80.089 3508 TB Utrecht The Netherlands Email: bernd@cs.ruu.nl
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-01.ps.gz, 19940210
Bottom-up Grammar Analysis | A Functional Formulation | Johan Jeuring and Doaitse Swierstra UU-CS-1994-01 January 1994 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 Bottom-up Grammar Analysis | A Functional
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-11.ps.gz, 19940225
Domino Treewidth Hans L. Bodlaender Joost Engelfriet UU-CS-1994-11 February 1994 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 Domino Treewidth Hans L. Bodlaender Joost Engelfriet Technical Report
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-12.ps.gz, 19940302
On Lazy Randomized Incremental Construction Mark de Berg Katrin Dobrindt Otfried Schwarzkopf UU{CS{1994{12 February 1994 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 On Lazy Randomized Incremental
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1988/1988-23.ps.gz, 19940308
Optimal Synchronization of ABD Networks Gerard Tel Ephraim Korach Shmuel Zaks RUU-CS-88-23 May 1988 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 Optimal Synchronization of ABD Networks Gerard Tel Ephraim
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-20.ps.gz, 19940310
Piecewise Linear Paths Among Convex Obstacles Mark de Berg Vakgroep Informatica, Universiteit Utrecht, Postbus 80.089, 3508 TB Utrecht, the Netherlands Ji<=r Matou<=sek Katedra aplikovan e matematiky, Universita Karlova, Malostransk e n am. 25, 118 00 Praha 1, Czech Republic and Institut fur
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-14.ps.gz, 19940322
W-hardness of Precedence Constrained K-processor Scheduling Hans L. Bodlaender Michael R. Fellows y
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-15.ps.gz, 19940331
Situations, a General Framework for Studying Information Retrieval T.W.C. Huibers P.D. Bruza Dept. of Computer Science School of Information Systems Utrecht University Queensland University of Technology PO Box 80.089 GPO Box 2434 3508 TB Utrecht Brisbane Q 4001 The Netherlands Australia theo@cs.ruu.nl
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-20.ps.gz, 19940602
Termination of logic programs via labelled term rewrite systems Thomas Arts and Hans Zantema Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. e-mail: thomas@cs.ruu.nl UU-CS-1994-20 May 1994 Utrecht University Department of Computer Science Padualaan
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1992/1992-41.ps.gz, 19940603
Two Algorithms for Finding Rectangular Duals of Planar Graphs Goos Kant Xin He Department of Computer Science Department of Computer Science Utrecht University State University of New York at Buffalo Padualaan 14, 3584 CH Utrecht Buffalo, NY 14260 the Netherlands United States of America goos@cs.ruu.nl
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-26.ps.gz, 19940603
A More Compact Visibility Representation Goos Kant Dept. of Computer Science Utrecht University Padualaan 14 3584 CH Utrecht the Netherlands goos@cs.ruu.nl RUU-CS-93-26 August 1993 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : +
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-45.ps.gz, 19940603
Convex Grid Drawings of 3-Connected Planar Graphs M. Chrobak G. Kant RUU-CS-93-45 December 1993 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 Convex Grid Drawings of 3-Connected Planar Graphs M. Chrobak G.
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1992/1992-03.ps.gz, 19940603
An O(n2) Maximal Planarization Algorithm based on PQ-trees Goos Kant Dept. of Computer Science, Utrecht University P.O. Box 80.089, 3508 TB Utrecht, the Netherlands RUU-CS-92-03 January 1992 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1992/1992-33.ps.gz, 19940603
Drawing Planar Graphs Using the Canonical Ordering Goos Kant Dept. of Computer Science, Utrecht University P.O. Box 80.089, 3508 TB Utrecht, the Netherlands RUU-CS-92-33 October 1992 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. :
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1992/1992-34.ps.gz, 19940623
Conditional Dependence in Probabilistic Networks Remco R. Bouckaert RUU-CS-92-34 1992 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 Conditional Dependence in Probabilistic Networks Remco R. Bouckaert Technical
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1992/1992-36.ps.gz, 19940623
Bayesian Belief Networks and Conditional Independencies Remco R. Bouckaert RUU-CS-92-36 1992 Utrecht University Department of Computer Science Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, Tel. : + 31 - 30 - 531454 Bayesian Belief Networks and Conditional Independencies Remco R.
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-16.ps.gz, 19940623
1e-05 0.0001 0.001 0.01 10 100 1000 10000 strat.l 3 3 3 3333 3333 3 3 3333333 strat.l+s + strat.l-r+s 2 2 2 2 2 222222 2 2 2222222 likelihood time (ms) mean log error Figure 9: Results for various optimizations. 1e-06 1e-05 0.0001 0.001 0.01
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1991/1991-32.ps.gz, 19940627
Global Virtual Time Approximation with Distributed Termination Detection Algorithms Friedemann Mattern Department of Computer Science, University of Saarbrucken, Im Stadtwald 36, D 6600 Saarbrucken, Fed. Rep. Germany Email: mattern@cs.uni{sb.de Horst Mehl Department of Computer Science, University of
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1989/1989-22.ps.gz, 19940627
Trade-offs in Non-reversing Diameter Hans L. Bodlaender Gerard Tel y Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. email: hansb,gerard@cs.ruu.nl Nicola Santoroy Carleton School of Computer Science, Ottawa (Ont.) K1S 5B6, CANADA email:
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1990/1990-24.ps.gz, 19940627
The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes Gerard Tel Department of Computer Science, University of Utrecht, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands Email: gerard@cs.ruu.nl Friedemann Mattern Department of Computer Science, University of
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1988/1988-16.ps.gz, 19940627
Total Algorithms Gerard Tely Department of Computer Science, University of Utrecht, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. email: gerard@cs.ruu.nl April 1988 Revised November 1989 and February 1993
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-10.ps.gz, 19940711
Connected Component and Simple Polygon Intersection Searching Pankaj K. Agarwaly Marc van Kreveldz
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-17.ps.gz, 19940912
THE FLOODLIGHT PROBLEM Prosenjit Bose1 Leonidas Guibas2 Anna Lubiw3 Mark Overmars4 Diane Souvaine5 Jorge Urrutia6
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-03.ps.gz, 19940915
REFERENCES 27 J.-P. Laumond, M. Ta x, and P. Jacobs. A motion planner for carlike robots based on a global/local approach. In Proc. IEEE Internat. Workshop Intell. Robots Syst., pages 76573, 1990. J. Mastwijk. Motion planning using potential field methods. master thesis, Utrecht, the
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-24.ps.gz, 19941018
Termination of term rewriting by semantic labelling H. Zantema Utrecht University, Department of Computer Science, P.O. box 80.089, 3508 TB Utrecht, The Netherlands e-mail: hansz@cs.ruu.nl
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-15.ps.gz, 19941031
On a Class of O(n2) Problems in Computational Geometry Anka Gajentaan and Mark H. Overmarsy
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-34.ps.gz, 19941102
TEACHING COMPUTATIONAL GEOMETRY Mark H. Overmars Department of Computer Science Utrecht University P.O. Box 80.089 3508 TB Utrecht THE NETHERLANDS e-mail: markov@cs.ruu.nl
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-31.ps.gz, 19950106
Selective Evidence Gathering for Diagnostic Belief Networks Linda van der Gaag & Maria Wessels Utrecht University, Department of Computer Science P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1991/1991-49.ps.gz, 19950719
Kayles on special classes of graphs | An application of Sprague-Grundy theory Hans L. Bodlaender Department of Computer Science, Utrecht University P.O. Box 80.089, 3508 TB Utrecht, the Netherlands
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1986/1986-16.ps.gz, 19960213
Using attribute grammars to derive efficient functional programs M.F. Kuiper and S.D. Swierstra Department of Computer Science, University of Utrecht P.O.Box 80.089, 3508 TB Utrecht, The Netherlands email: kuiper@cs.ruu.nl
open this document and view contentsftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1993/1993-18.ps.gz, 19960422
A PROBABILISTIC APPROACH TO MOTION PLANNING FOR CAR-LIKE ROBOTS 1 Petr <=Svestka INF/SCR-93-11 April 22, 1996 1This research was partially supported by the ESPRIT III BRA Project 6546 (PRO- Motion) and by the Dutch Organisation for Scientific Research (N.W.O.). Contents 1 Introduction 3 2 Preliminaries