Sciweavers

648 search results - page 42 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
CORR
2004
Springer
92views Education» more  CORR 2004»
13 years 7 months ago
Tournament versus Fitness Uniform Selection
1 In evolutionary algorithms a critical parameter that must be tuned is that of selection pressure. If it is set too low then the rate of convergence towards the optimum is likely...
Shane Legg, Marcus Hutter, Akshat Kumar
DEXA
2010
Springer
319views Database» more  DEXA 2010»
13 years 8 months ago
An Efficient Similarity Join Algorithm with Cosine Similarity Predicate
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
Dongjoo Lee, Jaehui Park, Junho Shim, Sang-goo Lee
GLOBECOM
2007
IEEE
14 years 2 months ago
Multiconstrained QoS Routing: Greedy is Good
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
Guoliang Xue, Weiyi Zhang
NIPS
2007
13 years 9 months ago
Selecting Observations against Adversarial Objectives
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
Andreas Krause, H. Brendan McMahan, Carlos Guestri...
CRV
2009
IEEE
153views Robotics» more  CRV 2009»
14 years 2 months ago
Optimal Online Data Sampling or How to Hire the Best Secretaries
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
Yogesh Girdhar, Gregory Dudek