648 search results - page 42 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
102
Voted
CORR
2004
Springer
15 years 12 days ago
2004
Springer
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...
134
Voted
DEXA
2010
Springer
15 years 23 days ago
2010
Springer
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 ...
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— 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...
92
Voted
NIPS
2007
15 years 2 months ago
2007
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...
93
Voted
CRV
2009
IEEE
15 years 7 months ago
2009
IEEE
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...