446 search results - page 29 / 90 » Multiple voting location problems |
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, a...
SP
2005
IEEE
14 years 1 months ago
2005
IEEE
The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Reconstruction of the point source of blood splatter in a crime scene is an important and difficult problem in forensic science. We study the problem of automatically reconstructi...
BROADNETS
2006
IEEE
14 years 1 months ago
2006
IEEE
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
ESCIENCE
2006
IEEE
14 years 1 months ago
2006
IEEE
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...