Sciweavers

188 search results - page 15 / 38
» Finding Best k Policies
Sort
View
DIS
2008
Springer
13 years 11 months ago
Active Learning for High Throughput Screening
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
Kurt De Grave, Jan Ramon, Luc De Raedt
JUCS
2008
158views more  JUCS 2008»
13 years 9 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
KDD
1995
ACM
139views Data Mining» more  KDD 1995»
14 years 1 months ago
Extracting Support Data for a Given Task
We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support Vec...
Bernhard Schölkopf, Chris Burges, Vladimir Va...
HPCA
2003
IEEE
14 years 10 months ago
Dynamic Voltage Scaling with Links for Power Optimization of Interconnection Networks
Originally developed to connect processors and memories in multicomputers, prior research and design of interconnection networks have focused largely on performance. As these netw...
Li Shang, Li-Shiuan Peh, Niraj K. Jha
INFOCOM
2010
IEEE
13 years 7 months ago
Predicting Prefix Availability in the Internet
The Border Gateway Protocol (BGP) maintains inter-domain routing information by announcing and withdrawing IP prefixes, possibly resulting in temporary prefix unreachability. Prefi...
Ravish Khosla, Sonia Fahmy, Y. Charlie Hu, Jennife...