1478 search results - page 54 / 296 » Modular Complexity Analysis via Relative Complexity |
124
click to vote
DSN
2007
IEEE
15 years 8 months ago
2007
IEEE
Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components’ behaviors and interactions. Being a high level model and easy to use...
156
click to vote
IJCAI
2001
15 years 3 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
127
click to vote
PAIRING
2007
Springer
15 years 8 months ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
116
click to vote
ICAPR
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. In this contribution, a novel and robust, geometry-based grouping strategy is proposed. Repeated, planar patterns in special relative positions are detected. The grouping...
191
click to vote
ILP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...