Sciweavers

1439 search results - page 177 / 288
» Bagging with Adaptive Costs
Sort
View
IPL
2007
111views more  IPL 2007»
13 years 9 months ago
Scalable Bloom Filters
Bloom Filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori bas...
Paulo Sérgio Almeida, Carlos Baquero, Nuno ...
TWC
2008
140views more  TWC 2008»
13 years 9 months ago
Low complexity and fractional coded cooperation for wireless networks
Wireless networks, and especially wireless sensor networks, have complexity and energy constraints, within which they must confront the challenging wireless fading environment. In ...
Andrew W. Eckford, Josephine P. K. Chu, Raviraj S....
PC
2000
120views Management» more  PC 2000»
13 years 9 months ago
Real-time sonar beamforming on high-performance distributed computers
Rapid advancements in acoustical beamforming techniques for array signal processing are producing algorithms with increased levels of computational complexity. Concomitantly, auto...
Alan D. George, Jeff Markwell, Ryan Fogarty
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 9 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
SIAMCO
2000
117views more  SIAMCO 2000»
13 years 9 months ago
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
Vivek S. Borkar, Sean P. Meyn