206 search results - page 14 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
118
click to vote
IPSN
2007
Springer
15 years 3 months ago
2007
Springer
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
90
Voted
AAAI
1998
14 years 11 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...