949 search results - page 81 / 190 » exact 2008 |
80
Voted
DM
2000
14 years 10 months ago
2000
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
84
Voted
DAM
2002
14 years 10 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
74
Voted
SIAMCO
2000
14 years 10 months ago
2000
We face the problem of determining a tracking domain of attraction, say the set of initial states starting from which it is possible to track reference signals in given class, for...
74
Voted
CI
1998
14 years 10 months ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
66
Voted
SIAMCO
2002
14 years 10 months ago
2002
In this paper we develop and present new convex synthesis conditions for robust performance in linear time-varying systems, subject to time-varying perturbations. In particular, th...