167 search results - page 28 / 34 » A class of polynomially solvable linear complementarity prob... |
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
DEDS
2010
13 years 7 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
IJCAI
2003
13 years 9 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
CDC
2009
IEEE
14 years 9 days ago
2009
IEEE
— This paper deals with the class of polynomially uncertain continuous-time linear time-invariant (LTI) systems whose uncertainties belong to a semi-algebraic set. The objective ...