Sciweavers

804 search results - page 26 / 161
» The Need for Speed
Sort
View
ESOP
2000
Springer
14 years 7 days ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
VLDB
1995
ACM
112views Database» more  VLDB 1995»
14 years 4 days ago
Type Classification of Semi-Structured Documents
Semi-structured documents (e.g. journal art,icles, electronic mail, television programs, mail order catalogs, ...) a.re often not explicitly typed; the only available t,ype inform...
Markus Tresch, Neal Palmer, Allen Luniewski
AAAI
2007
13 years 11 months ago
Action-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling
ICGA
1993
75views Optimization» more  ICGA 1993»
13 years 10 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 8 months ago
A High Performance Memory Database for Web Application Caches
This paper presents the architecture and characteristics of a memory database intended to be used as a cache engine for web applications. Primary goals of this database are speed a...
Ivan Voras, Danko Basch, Mario Zagar