7055 search results - page 38 / 1411 » Some New 4-Designs |
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
ECOOPW
2000
Springer
15 years 4 months ago
2000
Springer
This report summarizes the presentations, discussions, and outcomes of the ECOOP’2000 Workshop on Object Interoperability, held in Sophia Antipolis, France, on Monday, June 12, 2...
AIPS
2006
15 years 1 months ago
2006
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....
CORR
2010
Springer
14 years 12 months ago
2010
Springer
This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.
APPML
2005
14 years 11 months ago
2005
Some new inequalities for the Cebysev functional in terms of the first derivative and applications for Taylor's expansion and generalised trapezoid formula are pointed out.