Sciweavers

2210 search results - page 326 / 442
» CLEF 2001 - Overview of Results
Sort
View
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
15 years 10 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
COCOON
2001
Springer
15 years 10 months ago
Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
Enrico Nardelli, Guido Proietti, Peter Widmayer
COLT
2001
Springer
15 years 10 months ago
Robust Learning - Rich and Poor
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes Ī...
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehag...
CONTEXT
2001
Springer
15 years 10 months ago
A Connectionist-Symbolic Approach to Modeling Agent Behavior: Neural Networks Grouped by Contexts
A recent report by the National Research Council (NRC) declares neural networks ā€œhold the most promise for providing powerful learning modelsā€. While some researchers have expe...
Amy E. Henninger, Avelino J. Gonzalez, Michael Geo...
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
15 years 10 months ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
Alexander Scivos, Bernhard Nebel