467 search results - page 41 / 94 » Roadmap of Infinite Results |
WSC
2004
13 years 10 months ago
2004
One feature of many naturally occurring or engineered complex systems is tremendous variability in event sizes. To account for it, the behavior of these systems is often described...
DM
2008
13 years 9 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
APAL
2006
13 years 9 months ago
2006
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
ITIIS
2010
13 years 7 months ago
2010
The random access systems, with retransmission diversity (RD) employment, over large random spreading code division multiple access (CDMA) channel subject to fading is investigate...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study positive measures that are solutions to an abstract optimisation problem, which is a generalisation of a classical variational problem with a constraint on infor...