921 search results - page 32 / 185 » Expressing Computational Complexity in Constructive Type The... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
DLOG
2008
13 years 10 months ago
2008
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
NAR
2011
12 years 10 months ago
2011
T1DBase (http://www.t1dbase.org) is web platform, which supports the type 1 diabetes (T1D) community. It integrates genetic, genomic and expression data relevant to T1D research a...
DFG
1992
Springer
13 years 12 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....