145 search results - page 19 / 29 » Parameterized Complexity Classes under Logical Reductions |
CPE
2003
Springer
14 years 1 months ago
2003
Springer
We describe the main features of SmArT, a software package providing a seamless environment for the logic and probabilistic analysis of complex systems. SmArT can combine differen...
ISAAC
1998
Springer
14 years 19 days ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give â...
CODES
2008
IEEE
14 years 2 months ago
2008
IEEE
The combination of flit-buffer flow control methods and latency-insensitive protocols is an effective solution for networks-on-chip (NoC). Since they both rely on backpressure...
IGPL
2010
13 years 7 months ago
2010
Researchers studying complex cognition have grown increasingly interested in mapping symbolic cognitive architectures onto subsymbolic brain models. Such a mapping seems essential...