1449 search results - page 179 / 290 » Finiteness results for sigmoidal |
155
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
164
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
134
click to vote
DAM
1999
15 years 6 months ago
1999
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
132
click to vote
MOC
2002
15 years 6 months ago
2002
We deal with the iterative solution of linear systems arising from so-called dual-dual mixed finite element formulations. The linear systems are of a two-fold saddle point structur...
158
click to vote
ORL
2002
15 years 6 months ago
2002
This paper considers an M/G/1 queue in which service time distributions in each busy period change according to a finite state Markov chain, embedded at the arrival instants of cu...