default search action
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. - (Withdrawn) 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. N. Pereira, William Bialek:
The information bottleneck method.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.