Sciweavers

3319 search results - page 359 / 664
» Type Theoretical Databases
Sort
View
116
Voted
FCT
2009
Springer
15 years 10 months ago
Independence Results for n-Ary Recursion Theorems
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
John Case, Samuel E. Moelius
116
Voted
SARA
2009
Springer
15 years 10 months ago
A Practical Use of Imperfect Recall
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
Kevin Waugh, Martin Zinkevich, Michael Johanson, M...
122
Voted
ESCIENCE
2007
IEEE
15 years 10 months ago
A Framework for Providing Hard Delay Guarantees in Grid Computing
Future Grid Networks should be able to provide Quality of Service (QoS) guarantees to their users. In this work we propose a framework for Grid Networks that provides deterministi...
Panagiotis C. Kokkinos, Emmanouel A. Varvarigos, N...
144
Voted
IJCNN
2007
IEEE
15 years 10 months ago
Neurolinguistic Approach to Vector Representation of Medical Concepts
Abstract—Putative brain processes responsible for understanding language are based on spreading activation in semantic networks, providing enhanced representations that involve c...
Wlodzislaw Duch, Pawel Matykiewicz, John Pestian
156
Voted
CSR
2007
Springer
15 years 10 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen