CoRR, April 2000
- Marcus Hutter:
A Theory of Universal Artificial Intelligence based on Algorithmic Complexity.

- Krzysztof R. Apt, Andrea Schaerf:
Programming in Alma-0, or Imperative and Declarative Programming Reconciled.

- David Eppstein:
Searching for Spaceships.

- Ronald F. Boisvert:
Mathematical Software: Past, Present, and Future.

- Ke Xu, Wei Li:
Exact Phase Transitions in Random Constraint Satisfaction Problems.

- Filomena Ferrucci, Giuliano Pacini, Maria I. Sessa:
On Redundancy Elimination Tolerant Scheduling Rules.

- Markus Frick, Martin Grohe:
Deciding first-order properties of locally tree-decomposable structures.

- Eric Breck, John D. Burger, Lisa Ferro, Lynette Hirschman, David House, Marc Light, Inderjeet Mani:
How to Evaluate your Question Answering System Every Day and Still Get Real Work Done.

- David B. Benson:
Separating the complexity classes NL and NP.

- Lex Weaver:
Design and Evaluation of Mechanisms for a Multicomputer Object Store.

- Burkhard D. Steinmacher-Burow:
Task Frames.

- Emmanuel Etiévent, Frank Lebourgeois, Jean-Michel Jolion:
Assisted Video Sequences Indexing : Motion Analysis Based on Interest Points.

- Lex Weaver, Andrew Lynes:
Sorting Integers on the AP1000.

- Mark Baker:
Cluster Computing White Paper.

- Christian Bauer, Alexander Frink, Richard Kreckel:
Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language.

- Tony Berber Sardinha:
Looking at discourse in a corpus: The role of lexical cohesion.

- Massimo Di Pierro:
Matrix Distributed Processing: A set of C++ Tools for implementing generic lattice computations on parallel systems.

- Gregory J. Chaitin:
A Century of Controvery Over the Foundations of Mathematics II.

- Naftali Tishby, Fernando C. Pereira, William Bialek:
The information bottleneck method.

Last update Mon May 20 00:06:02 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page