4377 search results - page 654 / 876 » Mass problems and randomness |
163
click to vote
WEA
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
162
click to vote
MOBICOM
2004
ACM
16 years 1 days ago
2004
ACM
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
199
click to vote
DIALM
2003
ACM
15 years 12 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
199
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
139
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern wi...