Sciweavers

129 search results - page 11 / 26
» cost 1994
Sort
View
KR
1994
Springer
13 years 11 months ago
Risk-Sensitive Planning with Probabilistic Decision Graphs
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
Sven Koenig, Reid G. Simmons
DAGSTUHL
1994
13 years 9 months ago
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
Christian Icking, Rolf Klein
SODA
1994
ACM
88views Algorithms» more  SODA 1994»
13 years 9 months ago
Optimal Prediction for Prefetching in the Worst Case
Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...
P. Krishnan, Jeffrey Scott Vitter
PDIS
1994
IEEE
13 years 11 months ago
An Efficient Parallel Join Algorithm Based On Hypercube-Partitioning
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
Hwan-Ik Choi, Byoung Mo Im, Myoung-Ho Kim, Yoon-Jo...
ER
1994
Springer
121views Database» more  ER 1994»
13 years 11 months ago
An Executable Meta Model for Re-Engineering of Database Schemas
A logical database schema, e.g. a relational one, is an implementation of a speci cation, e.g. an entity-relationship diagram. Upcoming new data models and the necessity of seamle...
Manfred A. Jeusfeld, Uwe A. Johnen