7106 search results - page 747 / 1422 » Restricted Complexity, General Complexity |
217
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
240
click to vote
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
191
click to vote
AAMAS
2007
Springer
15 years 7 months ago
2007
Springer
An original Reinforcement Learning (RL) methodology is proposed for the design of multi-agent systems. In the realistic setting of situated agents with local perception, the task o...
216
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
199
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...