15375 search results - page 71 / 3075 » cans 2008 |
DAM
2008
13 years 7 months ago
2008
All sufficient (as well as necessary) conditions for a binary relation on a metric space to admit a maximal element on every nonempty compact subset of its domain that have been f...
DM
2008
13 years 7 months ago
2008
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of t...
DM
2008
13 years 7 months ago
2008
Abstract. It is known that the weight enumerator of a self-dual doublyeven code in genus g = 1 can be uniquely written as an isobaric polynomial in certain homogeneous polynomials ...
DSS
2008
13 years 7 months ago
2008
This study shows how artificial neural networks can be used to model consumer choice. Our study focuses on two key issues in neural network modeling
EJC
2008
13 years 7 months ago
2008
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...