1671 search results - page 267 / 335 » On the Covering Steiner Problem |
LCN
2003
IEEE
15 years 5 months ago
2003
IEEE
Studies of mobile ad-hoc networks are often based on simulation and their underlying, necessarily simplified assumptions of physical reality. In order to analyse the practical pro...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
ICCSA
2003
Springer
15 years 5 months ago
2003
Springer
A speaker model in speaker recognition system is to be trained from a large data set gathered in multiple sessions. Large data set requires large amount of memory and computation, ...
IPSN
2003
Springer
15 years 5 months ago
2003
Springer
We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant moti...
PARELEC
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...