9631 search results - page 45 / 1927 » The Costs of Using JXTA |
UAI
2004
15 years 1 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
101
click to vote
CP
2007
Springer
15 years 6 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
125
click to vote
FODO
1998
Springer
15 years 4 months ago
1998
Springer
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
CAEPIA
2007
Springer
15 years 6 months ago
2007
Springer
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
ICDE
2007
IEEE
15 years 6 months ago
2007
IEEE
Most database query optimizers use cost models to identify good query execution plans. Inaccuracies in the cost models can cause query optimizers to select poor plans. In this pap...