1407 search results - page 257 / 282 » Learning Abstract Scheduling Models |
125
click to vote
HICSS
1995
IEEE
15 years 5 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
141
click to vote
CSCLP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
129
click to vote
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Multi-core processors with accelerators are becoming commodity components for high-performance computing at scale. While accelerator-based processors have been studied in...
106
click to vote
TCOM
2008
15 years 2 months ago
2008
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
133
Voted
TMM
2002
15 years 1 months ago
2002
Abstract--Current video-on-demand (VoD) systems can be classified into two categories: 1) true-VoD (TVoD) and 2) near-VoD (NVoD). TVoD systems allocate a dedicated channel for ever...