364 search results - page 23 / 73 » On the generalization of soft margin algorithms |
GECCO
2006
Springer
14 years 23 days ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
RTAS
2010
IEEE
13 years 7 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
The field of transfer learning aims to speed up learning across multiple related tasks by transferring knowledge between source and target tasks. Past work has shown that when th...
ICRA
2002
IEEE
14 years 2 months ago
2002
IEEE
Abstract—A methodology for estimating the force distribution that occurs along a needle shaft during insertion is described. To validate the approach, an experimental system for ...
JACM
2000
13 years 9 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...