3223 search results - page 230 / 645 » The Scaling of Search Cost |
164
click to vote
AIPS
2008
15 years 9 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
127
click to vote
SLP
1989
15 years 7 months ago
1989
This paper describes a learning system, LASSY1, which explores domains represented by Prolog databases, and use its acquired knowledge to increase the efficiency of a Prolog inter...
155
click to vote
TKDE
1998
15 years 6 months ago
1998
—We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and asso...
162
Voted
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Multi-objective genetic algorithms have been often used to optimize classification systems, but little is discussed on their computational cost to solve such problems. This paper ...
198
click to vote
FSTTCS
1998
Springer
15 years 10 months ago
1998
Springer
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...