4894 search results - page 681 / 979 » The Guarding Problem - Complexity and Approximation |
114
click to vote
CPM
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
127
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
119
click to vote
IDEAL
2004
Springer
15 years 9 months ago
2004
Springer
This paper defines a constrained Artificial Neural Network (ANN) that can be employed for highly-dependable roles in safety critical applications. The derived model is based upon t...
104
click to vote
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
We present a methodology for a sensor network to answer queries with limited and stochastic information using probabilistic techniques. This capability is useful in that it allows...
137
click to vote
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...