Sciweavers

1679 search results - page 332 / 336
» Strong order equivalence
Sort
View
DSD
2010
IEEE
112views Hardware» more  DSD 2010»
13 years 7 months ago
Re-NUCA: Boosting CMP Performance Through Block Replication
— Chip Multiprocessor (CMP) systems have become the reference architecture for designing micro-processors, thanks to the improvements in semiconductor nanotechnology that have co...
Pierfrancesco Foglia, Cosimo Antonio Prete, Marco ...
JCO
2010
99views more  JCO 2010»
13 years 7 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
MICCAI
2010
Springer
13 years 7 months ago
Incorporating Priors on Expert Performance Parameters for Segmentation Validation and Label Fusion: A Maximum a Posteriori STAPL
Abstract. In order to evaluate the quality of segmentations of an image and assess intra- and inter-expert variability in segmentation performance, an Expectation Maximization (EM)...
Olivier Commowick, Simon K. Warfield
PERCOM
2010
ACM
13 years 7 months ago
The co-evolution of taxi drivers and their in-car navigation systems
In the recent years, the massive use of in-car navigation systems has symbolized the emergence of location-based services for wayfinding. This market success creates the opportunit...
Fabien Girardin, Josep Blat
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 7 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg