7129 search results - page 746 / 1426 » Approximation Algorithms for Treewidth |
182
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
189
click to vote
KDD
1997
ACM
15 years 11 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
166
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we introduce XCSF with support vector prediction: the problem of learning the prediction function is solved as a support vector regression problem and each classifie...
193
click to vote
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Support for efficient multicasting in WLANs can enable new services such as streaming TV channels, radio channels, and visitor's information. With increasing deployments of l...
169
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...