Sciweavers

2313 search results - page 215 / 463
» On Heuristic Time Hierarchies
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 10 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
RT
2000
Springer
15 years 10 months ago
Hierarchical Instantiation for Radiosity
We present the concept of hierarchical instantiation for radiosity. This new method enables an efficient, yet accurate determination of the illumination in very large scenes, wher...
Cyril Soler, François X. Sillion
OPODIS
2010
15 years 4 months ago
Failure Detectors Encapsulate Fairness
Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsu...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
SIGMETRICS
2008
ACM
15 years 6 months ago
Scheduling despite inexact job-size information
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
Adam Wierman, Misja Nuyens
AI
2009
Springer
16 years 1 months ago
Opinion Learning without Emotional Words
This paper shows that a detailed, although non-emotional, description of event or an action can be a reliable source for learning opinions. Empirical results show the practical uti...
Marina Sokolova, Guy Lapalme