2661 search results - page 414 / 533 » Quantum Complexity Classes |
146
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
100
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
130
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Automatically assessing the value of bioavailability from the chemical structure of a molecule is a very important issue in biomedicine and pharmacology. In this paper, we present...
113
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...