457 search results - page 21 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
133
click to vote
ALENEX
2007
15 years 7 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
184
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One of the difficulties in calculating the capacity of certain Poisson channels is that H(), the entropy of the Poisson distribution with mean , is not available in a simple form. ...
279
click to vote
ICAART
2010
INSTICC
16 years 3 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
164
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
163
click to vote
NIPS
1998
15 years 7 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...