1552 search results - page 148 / 311 » On the Complexity of Constant Propagation |
162
click to vote
IPSN
2007
Springer
16 years 19 days ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
228
click to vote
BROADNETS
2005
IEEE
16 years 3 days ago
2005
IEEE
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
224
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
176
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
146
click to vote
DLT
2008
15 years 8 months ago
2008
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...