3874 search results - page 406 / 775 » Approximation Algorithms for k-hurdle Problems |
177
click to vote
ICTAI
2009
IEEE
16 years 1 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
201
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
177
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
165
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
178
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...