5608 search results - page 984 / 1122 » On the Theory of Matchgate Computations |
102
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...
134
Voted
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
110
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
104
click to vote
FCT
2009
Springer
15 years 8 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
102
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...