3656 search results - page 365 / 732 » Compact Location Problems |
173
click to vote
SODA
1990
ACM
15 years 8 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
169
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...
284
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
218
click to vote
CANDC
2004
ACM
15 years 6 months ago
2004
ACM
Gene and protein names follow few, if any, true naming conventions and are subject to great variation in different occurrences of the same name. This gives rise to two important p...
191
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...