197 search results - page 28 / 40 » Semidefinite programming based approaches to the break minim... |
KDD
2000
ACM
14 years 8 hour ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
LCN
1997
IEEE
14 years 19 days ago
1997
IEEE
This paper studies the optimal configuration of virtual paths in ATM networks. A linear model that minimizes the mrximumjow density of links is proposed for the optimal virtual pa...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
ISSTA
2006
ACM
14 years 2 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
CEC
2007
IEEE
14 years 12 days ago
2007
IEEE
This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of...