Sciweavers

1080 search results - page 26 / 216
» Problem dependent optimization (PDO)
Sort
View
ISCAPDCS
2007
15 years 5 months ago
A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
Omar Kermia, Yves Sorel
JAIR
2006
121views more  JAIR 2006»
15 years 3 months ago
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
Matthew J. Streeter, Stephen F. Smith
ICASSP
2008
IEEE
15 years 10 months ago
Learning the kernel via convex optimization
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...
Seung-Jean Kim, Argyrios Zymnis, Alessandro Magnan...
VEE
2012
ACM
187views Virtualization» more  VEE 2012»
13 years 11 months ago
DDGacc: boosting dynamic DDG-based binary optimizations through specialized hardware support
Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualiza...
Demos Pavlou, Enric Gibert, Fernando Latorre, Anto...
IBERAMIA
2010
Springer
15 years 2 months ago
Interaction Graphs for Multivariate Binary Data
We define a class of graphs that summarize in a compact visual way the interaction structure between binary multivariate characteristics. This allows studying the conditional depe...
Johan Van Horentonioeek, Jesús Emeterio Nav...