3874 search results - page 330 / 775 » Approximation Algorithms for k-hurdle Problems |
152
Voted
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
144
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
156
click to vote
SIAMDM
2010
14 years 11 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
134
click to vote
RTSS
1999
IEEE
15 years 9 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
162
click to vote
PREMI
2005
Springer
15 years 10 months ago
2005
Springer
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...