288 search results - page 52 / 58 » Inclusion Problems for Patterns with a Bounded Number of Var... |
121
click to vote
CCE
2004
15 years 3 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
150
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
137
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
136
click to vote
ESSMAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We consider a linear system, such as an estimator or a controller, in which several signals are transmitted over wireless communication channels. With the coding and medi...
144
click to vote
KR
2004
Springer
15 years 8 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...