3019 search results - page 97 / 604 » Approximating the Domatic Number |
ENTCS
2008
14 years 12 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
109
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
TSMC
1998
14 years 11 months ago
1998
— In this paper, the problem of stabilization of unknown nonlinear dynamical systems is considered. An adaptive feedback law is constructed that is based on the switching adaptiv...
JC
2006
14 years 12 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
DAGSTUHL
2004
15 years 1 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...