840 search results - page 145 / 168 » Inapproximability of Combinatorial Optimization Problems |
ECAI
2004
Springer
14 years 3 months ago
2004
Springer
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
RSP
1998
IEEE
14 years 2 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
VLDB
1997
ACM
14 years 2 months ago
1997
ACM
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...
JAIR
2007
13 years 9 months ago
2007
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
JCO
2000
13 years 9 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...