Sciweavers

66 search results - page 7 / 14
» Using Caching to Solve Larger Probabilistic Planning Problem...
Sort
View
91
Voted
ACSAC
2004
IEEE
15 years 3 months ago
Attack Plan Recognition and Prediction Using Causal Networks
Correlating and analyzing security alerts is a critical and challenging task in security management. Recently, some techniques have been proposed for security alert correlation. H...
Xinzhou Qin, Wenke Lee
SIAMJO
2008
72views more  SIAMJO 2008»
14 years 11 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 4 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
AAAI
1998
15 years 29 days ago
Procedural Help in Andes: Generating Hints Using a Bayesian Network Student Model
One of the most important problems for an intelligent tutoring system is deciding how to respond when a student asks for help. Responding cooperatively requires an understanding o...
Abigail S. Gertner, Cristina Conati, Kurt VanLehn
88
Voted
CP
2004
Springer
15 years 5 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker