Sciweavers

16 search results - page 2 / 4
» Preemption Points Placement for Sporadic Task Sets
Sort
View
EMSOFT
2007
Springer
13 years 11 months ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer
IVS
2002
82views more  IVS 2002»
13 years 4 months ago
A taxonomy of glyph placement strategies for multidimensional data visualization
Glyphs are graphical entities that convey one or more data values via attributes such as shape, size, color, and position. They have been widely used in the visualization of data ...
Matthew O. Ward
ISPD
2003
ACM
92views Hardware» more  ISPD 2003»
13 years 10 months ago
Benchmarking for large-scale placement and beyond
Over the last five years the VLSI Placement community achieved great strides in the understanding of placement problems, developed new high-performance algorithms, and achieved i...
Saurabh N. Adya, Mehmet Can Yildiz, Igor L. Markov...
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 4 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ICML
2005
IEEE
14 years 5 months ago
Near-optimal sensor placements in Gaussian processes
When monitoring spatial phenomena, which are often modeled as Gaussian Processes (GPs), choosing sensor locations is a fundamental task. A common strategy is to place sensors at t...
Carlos Guestrin, Andreas Krause, Ajit Paul Singh