Sciweavers

5269 search results - page 111 / 1054
» order 2007
Sort
View
ANOR
2006
58views more  ANOR 2006»
15 years 4 months ago
A management system for decompositions in stochastic programming
This paper presents two contributions: A set of routines that manipulate instances of stochastic programming problems in order to make them more amenable for different solution ap...
Robert Fourer, Leo Lopes
AUTOMATICA
2006
68views more  AUTOMATICA 2006»
15 years 4 months ago
State and unknown input estimation for linear discrete-time systems
: This paper deals with a new type of estimator for discrete-time linear systems with unknown inputs. A constructive algorithm is given in order to analyze the state observability ...
Thierry Floquet, Jean-Pierre Barbot
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
15 years 4 months ago
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...
Arvind Ayyer, Doron Zeilberger
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 4 months ago
Note on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Gregory Gutin
DM
2007
113views more  DM 2007»
15 years 4 months ago
Counting labeled general cubic graphs
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso...