Sciweavers

1146 search results - page 128 / 230
» Finite cupping sets
Sort
View
JGT
2006
60views more  JGT 2006»
13 years 10 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato
ORDER
2006
97views more  ORDER 2006»
13 years 10 months ago
Chain Dominated Orders
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampo...
CJ
1999
95views more  CJ 1999»
13 years 9 months ago
Two Kinds of Probabilistic Induction
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
Ray J. Solomonoff
DCG
1999
58views more  DCG 1999»
13 years 9 months ago
Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
Peter Boyvalenkov, Danyo Danev, Svetla Nikova
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
13 years 8 months ago
A probabilistic approach for control of a stochastic system from LTL specifications
We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...
Morteza Lahijanian, Sean B. Andersson, Calin Belta