17760 search results - page 143 / 3552 » A Generalization of the Massey-Ding Algorithm |
142
click to vote
COR
2006
15 years 4 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
128
click to vote
AMAI
2005
Springer
15 years 3 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
150
click to vote
JMLR
2011
14 years 11 months ago
2011
We propose a fully Bayesian methodology for generalized kernel mixed models (GKMMs), which are extensions of generalized linear mixed models in the feature space induced by a repr...
131
click to vote
VLC
2011
14 years 11 months ago
2011
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams...
140
click to vote
SIAMCO
2010
14 years 10 months ago
2010
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...