451 search results - page 47 / 91 » On Parameterized Exponential Time Complexity |
FOSSACS
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
AAAI
2007
14 years 7 days ago
2007
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
AAIP
2009
13 years 11 months ago
2009
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
TCS
2008
13 years 9 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
In multiuser detection, the set of users active at any time may be unknown to the receiver. A two-step detection procedure, in which multiuser detection is preceded by active-user...