Sciweavers

1004 search results - page 113 / 201
» Product representations of polynomials
Sort
View
ACSAC
2003
IEEE
15 years 3 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...
ICCV
2003
IEEE
15 years 3 months ago
Meshfree Particle Method
Many of the computer vision algorithms have been posed in various forms of differential equations, derived from minimization of specific energy functionals, and the finite eleme...
Huafeng Liu, Pengcheng Shi
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 2 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
ATAL
2006
Springer
15 years 1 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
AIPS
2010
15 years 4 days ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...