Sciweavers

1568 search results - page 184 / 314
» The problem of examination questions in algorithmics
Sort
View
NIPS
2001
15 years 7 months ago
Online Learning with Kernels
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
Jyrki Kivinen, Alex J. Smola, Robert C. Williamson
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 7 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
ATAL
2008
Springer
15 years 8 months ago
Analysis of an evolutionary reinforcement learning method in a multiagent domain
Many multiagent problems comprise subtasks which can be considered as reinforcement learning (RL) problems. In addition to classical temporal difference methods, evolutionary algo...
Jan Hendrik Metzen, Mark Edgington, Yohannes Kassa...
WABI
2005
Springer
15 years 12 months ago
Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. C...
CAV
2003
Springer
166views Hardware» more  CAV 2003»
15 years 11 months ago
Bridging the Gap between Fair Simulation and Trace Inclusion
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
Yonit Kesten, Nir Piterman, Amir Pnueli