Sciweavers

26 search results - page 3 / 6
» Balanced state-space representations: a polynomial algebraic...
Sort
View
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 10 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 9 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...
COMPGEOM
2009
ACM
16 years 16 days ago
On the topology of planar algebraic curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
MICS
2010
123views more  MICS 2010»
15 years 4 months ago
On the Topology of Real Algebraic Plane Curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
ECCC
2010
83views more  ECCC 2010»
15 years 4 months ago
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...
Maurice Jansen, Youming Qiao, Jayalal M. N. Sarma