1188 search results - page 68 / 238 » Generating Connectives |
124
click to vote
ADHOC
2007
15 years 3 months ago
2007
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
139
click to vote
JGT
2008
15 years 3 months ago
2008
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
142
Voted
FPL
2007
Springer
15 years 7 months ago
2007
Springer
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
123
Voted
WAW
2004
Springer
15 years 8 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
124
Voted
ISNN
2007
Springer
15 years 9 months ago
2007
Springer
This paper investigates a mechanism for reliable generation of sparse code in a sparsely connected, hierarchical, learning memory. Activity reduction is accomplished with local com...