3708 search results - page 454 / 742 » Approximating Betweenness Centrality |
187
click to vote
DIALM
2003
ACM
16 years 2 hour ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
152
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
189
click to vote
AAAI
2007
15 years 9 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
156
click to vote
SIAMAM
2008
15 years 6 months ago
2008
Optical fibers are made of glass with different refractive indices in the (inner) core and the (outer) cladding regions. The difference in refractive index arises due to a rapid tr...
216
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...