4315 search results - page 157 / 863 » Sorting in linear time |
COMBINATORICS
2007
13 years 9 months ago
2007
![The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor")
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
INFORMATICALT
2010
13 years 7 months ago
2010
In the previous papers (Pupeikis, 2000; Genov et al., 2006; Atanasov and Pupeikis, 2009), a direct approach for estimating the parameters of a discrete-time linear time-invariant (...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
JDA
2006
13 years 9 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...