Sciweavers

1952 search results - page 330 / 391
» Complete partitions of graphs
Sort
View
ENDM
2006
91views more  ENDM 2006»
15 years 4 months ago
There are exactly five biplanes with k=11
A biplane is a 2-(k(k - 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k...
Patric R. J. Östergård, Petteri Kaski
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 4 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
137
Voted
DSS
2007
94views more  DSS 2007»
15 years 4 months ago
A formal modeling approach for supply chain event management
: As supply chains become more dynamic it is important to be able to model them formally as business processes. In particular, there is a need for a sense and respond capability to...
Rong Liu, Akhil Kumar, Wil M. P. van der Aalst
CPC
2002
205views more  CPC 2002»
15 years 4 months ago
Convergence Of The Iterated Prisoner's Dilemma Game
Co-learning is a model involving agents from a large population, who interact by playing a fixed game and update their behaviour based on previous experience and the outcome of th...
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
135
Voted
DAM
2002
135views more  DAM 2002»
15 years 4 months ago
Matchings in colored bipartite networks
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...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera