Sciweavers

11160 search results - page 165 / 2232
» Incompleteness in a General Setting
Sort
View
122
Voted
FCT
1993
Springer
15 years 4 months ago
Generalized Topological Sorting in Linear Time
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
Torben Hagerup, Martin Maas
99
Voted
ICCBR
2010
Springer
15 years 4 months ago
Reducing the Memory Footprint of Temporal Difference Learning over Finitely Many States by Using Case-Based Generalization
In this paper we present an approach for reducing the memory footprint requirement of temporal difference methods in which the set of states is finite. We use case-based generaliza...
Matt Dilts, Héctor Muñoz-Avila
93
Voted
AIIA
2007
Springer
15 years 2 months ago
Similarity-Guided Clause Generalization
Few works are available in the literature to define similarity criteria between First-Order Logic formulæ, where the presence of relations causes various portions of one descript...
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...
LREC
2008
117views Education» more  LREC 2008»
15 years 2 months ago
Evolutionary Basic Notions for a Thematic Representation of General Knowledge
In the field of Natural Language Processing, in order to work out a thematic representation system of general knowledge, methods relying on thesaurus have been used for about twen...
Alain Joubert, Mathieu Lafourcade
81
Voted
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
15 years 1 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs