Sciweavers

836 search results - page 128 / 168
» Adaptive independence samplers
Sort
View
WOB
2003
140views Bioinformatics» more  WOB 2003»
15 years 7 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
NIPS
1994
15 years 7 months ago
Boosting the Performance of RBF Networks with Dynamic Decay Adjustment
Radial Basis Function (RBF) Networks, also known as networks of locally{tuned processing units (see 6]) are well known for their ease of use. Most algorithms used to train these t...
Michael R. Berthold, Jay Diamond
ECAI
2010
Springer
15 years 7 months ago
Learning action effects in partially observable domains
We investigate the problem of learning action effects in partially observable STRIPS planning domains. Our approach is based on a voted kernel perceptron learning model, where act...
Kira Mourão, Ronald P. A. Petrick, Mark Ste...
ESORICS
2010
Springer
15 years 7 months ago
A New Framework for RFID Privacy
Formal RFID security and privacy frameworks are fundamental to the design and analysis of robust RFID systems. In this paper, we develop a new definitional framework for RFID priv...
Robert H. Deng, Yingjiu Li, Moti Yung, Yunlei Zhao
COR
2010
155views more  COR 2010»
15 years 6 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...