672 search results - page 109 / 135 » Almost Optimal Dispersers |
116
click to vote
NETWORKS
2002
14 years 11 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
TEC
2002
14 years 11 months ago
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
108
click to vote
KI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. In mobile and ubiquitous computing, there is a strong need for supporting different users with different interests, needs, and demands. Activity recognition systems for c...
ICICS
2010
Springer
14 years 9 months ago
2010
Springer
By now, many voting protocols have been proposed that, among others, are designed to achieve coercion-resistance, i.e., resistance to vote buying and voter coercion. Scantegrity II...
120
click to vote
PIMRC
2010
IEEE
14 years 9 months ago
2010
IEEE
In a multiuser system, independent time-varying channels among different users can be exploited to provide multiuser diversity (MUD) gain and increase the system throughput. For th...