Sciweavers

7978 search results - page 577 / 1596
» Combining shared-coin algorithms
Sort
View
AIPS
1994
15 years 8 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
AAAI
1990
15 years 8 months ago
Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction
This paper presents a projection algorithm for incremental control rule synthesis. The algorithm synthesizes an initial set of goal-achieving control rules using a combination of ...
Mark Drummond, John L. Bresina
FORTE
1989
15 years 8 months ago
Compilation of LOTOS Abstract Data Types
ion of LOTOS Abstract Data Types Hubert GARAVEL∗ Laboratoire de G´enie Informatique Institut I.M.A.G. GRENOBLE FRANCE This article describes an experiment with the compilation o...
Hubert Garavel
APVIS
2009
15 years 8 months ago
Extending the spring-electrical model to overcome warping effects
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
Yifan Hu, Yehuda Koren
GRIDNETS
2008
15 years 8 months ago
Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
Xiaohua Li