Sciweavers

199 search results - page 15 / 40
» Intensional Positive Set Theory
Sort
View

Publication
233views
12 years 6 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
DAM
2007
67views more  DAM 2007»
13 years 7 months ago
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
Gustav Nordh
CADE
2007
Springer
14 years 8 months ago
Hyper Tableaux with Equality
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
Björn Pelzer, Peter Baumgartner, Ulrich Furba...
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 1 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod
ISMB
1998
13 years 9 months ago
Phylogenetic Inference in Protein Superfamilies: Analysis of SH2 Domains
This workfocuses on the inference of evolutionary relationships in protein superfamilies, and the uses of these relationships to identify keypositions in the structure, to infer a...
Kimmen Sjölander