2519 search results - page 87 / 504 » cost 2007 |
146
click to vote
SIROCCO
2007
15 years 7 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
172
click to vote
NETWORKING
2004
15 years 7 months ago
2004
Subset Difference Revocation (SDR) [8] has been proposed to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message ove...
166
click to vote
NETWORKING
2004
15 years 7 months ago
2004
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
147
click to vote
ADHOC
2007
15 years 6 months ago
2007
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
155
click to vote
COR
2007
15 years 6 months ago
2007
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...