Sciweavers

3656 search results - page 54 / 732
» Compact Location Problems
Sort
View
CISS
2008
IEEE
14 years 4 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
IROS
2007
IEEE
127views Robotics» more  IROS 2007»
14 years 4 months ago
Goal directed navigation with uncertainty in adversary locations
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
Maxim Likhachev, Anthony Stentz
ICAISC
2010
Springer
13 years 12 months ago
UMTS Base Station Location Planning with Invasive Weed Optimization
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...
Rafal Zdunek, Tomasz Ignor
AAIM
2005
Springer
119views Algorithms» more  AAIM 2005»
13 years 12 months ago
Locating Performance Monitoring Mobile Agents in Scalable Active Networks
The idea of active networks has been emerged in recent years to increase the processing power inside the network. The intermediate nodes such as routers will be able to host mobile...
Amir Hossein Hadad, Mehdi Dehghan, Hossein Pedram
SCALESPACE
1999
Springer
14 years 2 months ago
Fast Marching to Moving Object Location
In this paper we address two important problems in motion analysis: the detection of moving objects and their localization. Statistical and level set approaches are adopted in orde...
Eftychios Sifakis, George Tziritas