2176 search results - page 423 / 436 » Refactoring Methods for Knowledge Bases |
COMPGEOM
2010
ACM
15 years 1 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
102
click to vote
CIKM
2004
Springer
15 years 1 months ago
2004
Springer
With the tremendous growth of system memories, memoryresident databases are increasingly becoming important in various domains. Newer memories provide a structured way of storing ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes an efficient agent for competing in Cliff Edge (CE) environments, such as sealed-bid auctions, dynamic pricing and the ultimatum game. The agent competes in on...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
AIPS
2008
14 years 12 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...