1461 search results - page 189 / 293 » Complexity of Graph Covering Problems |
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
4 Automatic differentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
ICRA
2006
IEEE
14 years 3 months ago
2006
IEEE
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
IPSN
2003
Springer
14 years 2 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
14 years 1 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...
FOCS
1995
IEEE
14 years 15 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...