1449 search results - page 126 / 290 » Self-Randomized Exponentiation Algorithms |
181
click to vote
LICS
2005
IEEE
15 years 12 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
148
click to vote
DNA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...
129
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
153
click to vote
PAPM
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...
179
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...