Sciweavers

3941 search results - page 543 / 789
» Computational Efficiency of Batching Methods
Sort
View
AIPS
2006
14 years 6 days ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir
DATESO
2004
118views Database» more  DATESO 2004»
14 years 6 days ago
LSI vs. Wordnet Ontology in Dimension Reduction for Information Retrieval
Abstract. In the area of information retrieval, the dimension of document vectors plays an important role. Firstly, with higher dimensions index structures suffer the "curse o...
Pavel Moravec, Michal Kolovrat, Václav Sn&a...
DAGSTUHL
2006
14 years 6 days ago
On impossibility of sequential algorithmic forecasting
The problem of prediction future event given an individual sequence of past events is considered. Predictions are given in form of real numbers pn which are computed by some algori...
Vladimir V. V'yugin
FLAIRS
2006
14 years 5 days ago
Improving Modularity in Genetic Programming Using Graph-Based Data Mining
We propose to improve the efficiency of genetic programming, a method to automatically evolve computer programs. We use graph-based data mining to identify common aspects of highl...
Istvan Jonyer, Akiko Himes
KDID
2004
134views Database» more  KDID 2004»
14 years 5 days ago
Theoretical Bounds on the Size of Condensed Representations
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
Nele Dexters, Toon Calders