Sciweavers

4747 search results - page 380 / 950
» Shuffle Memory System
Sort
View
CSCW
2002
ACM
15 years 6 months ago
Who can claim complete abstinence from peeking at print jobs?
While systems supporting communities of practice in work organizations have been shown to be desirable many, if not all, are decoupled from daily work practices and tools. This hi...
Antonietta Grasso, Jean-Luc Meunier
JOT
2008
105views more  JOT 2008»
15 years 6 months ago
Using Multiple Servers in Concurrent Garbage Collector
Object-oriented programming languages are being widely adopted as one of the most powerful languages due their flexibility and reusability. However, these languages suffer from me...
Ali Ebrahim El Desokey, Amany Sarhan, Seham Moawed
SIGMETRICS
2012
ACM
251views Hardware» more  SIGMETRICS 2012»
13 years 8 months ago
Providing fairness on shared-memory multiprocessors via process scheduling
Competition for shared memory resources on multiprocessors is the most dominant cause for slowing down applications and makes their performance varies unpredictably. It exacerbate...
Di Xu, Chenggang Wu, Pen-Chung Yew, Jianjun Li, Zh...
JVCA
2011
60views more  JVCA 2011»
14 years 9 months ago
UEGM: uncertain emotion generator under multi-stimulus
In this paper, we introduce a novel particle filtering architecture to simulate uncertain emotion generation under multi-stimulus, to enrich emotions for virtual characters. Parti...
Nan Xiang, Haiying Zhao, Xiaojian Zhou, Mingliang ...
CADE
2012
Springer
13 years 8 months ago
EPR-Based Bounded Model Checking at Word Level
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
Moshe Emmer, Zurab Khasidashvili, Konstantin Korov...