Sciweavers

16404 search results - page 925 / 3281
» A set coverage problem
Sort
View
ATAL
2007
Springer
16 years 1 months ago
IFSA: incremental feature-set augmentation for reinforcement learning tasks
Reinforcement learning is a popular and successful framework for many agent-related problems because only limited environmental feedback is necessary for learning. While many algo...
Mazda Ahmadi, Matthew E. Taylor, Peter Stone
IJSN
2006
65views more  IJSN 2006»
15 years 7 months ago
The loop fallacy and deterministic serialisation in tracing intrusion connections through stepping stones
: In order to conceal their identity and origin, network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate `stepping ...
Xinyuan Wang
212
Voted
BMCBI
2005
134views more  BMCBI 2005»
15 years 7 months ago
Systematic feature evaluation for gene name recognition
In task 1A of the BioCreAtIvE evaluation, systems had to be devised that recognize words and phrases forming gene or protein names in natural language sentences. We approach this ...
Jörg Hakenberg, Steffen Bickel, Conrad Plake,...
IJAC
2002
128views more  IJAC 2002»
15 years 7 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
330
Voted
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 9 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas