4372 search results - page 91 / 875 » Algorithmic Theories of Everything |
CICLING
2010
Springer
14 years 1 months ago
2010
Springer
We introduce an Information Extraction (IE) system which uses the logical theory of an ontology as a generalisation of the typical information extraction patterns to extract biolog...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
ECAI
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
HASKELL
2009
ACM
14 years 3 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
CHES
1999
Springer
14 years 1 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...