Sciweavers

3628 search results - page 317 / 726
» The Decision Diffie-Hellman Problem
Sort
View
VMCAI
2010
Springer
16 years 4 months ago
Complexity Bounds for the Verification of Real-Time Software
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
ICAART
2010
INSTICC
16 years 3 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
SCCC
2008
IEEE
16 years 1 months ago
A Domain Specific Language for the Development of Collaborative Systems
Domain-Specific Languages (DSLs) are high level languages defined for combining expressivity and simplicity by means of constructs which are close to the problem domain and distan...
Luis Mariano Bibbo, Diego García, Claudia P...
AE
2007
Springer
16 years 26 days ago
Adaptive and Assortative Mating Scheme for Evolutionary Multi-Objective Algorithms
We are interested in the role of restricted mating schemes in the context of evolutionary multi-objective algorithms. In this paper, we propose an adaptive assortative mating schem...
Khoi Le, Dario Landa Silva
CSR
2007
Springer
16 years 26 days ago
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
Artur Jez, Alexander Okhotin