Sciweavers

790 search results - page 155 / 158
» Limits of Work-Stealing Scheduling
Sort
View
AAAI
1994
14 years 5 days ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
CCGRID
2010
IEEE
13 years 12 months ago
Designing Accelerator-Based Distributed Systems for High Performance
Abstract--Multi-core processors with accelerators are becoming commodity components for high-performance computing at scale. While accelerator-based processors have been studied in...
M. Mustafa Rafique, Ali Raza Butt, Dimitrios S. Ni...
ECRTS
2010
IEEE
13 years 12 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
ESORICS
2010
Springer
13 years 12 months ago
Traffic Analysis against Low-Latency Anonymity Networks Using Available Bandwidth Estimation
Abstract. We introduce a novel remotely-mounted attack that can expose the network identity of an anonymous client, hidden service, and anonymizing proxies. To achieve this, we emp...
Sambuddho Chakravarty, Angelos Stavrou, Angelos D....
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 11 months ago
Sequential item pricing for unlimited supply
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
Maria-Florina Balcan, Florin Constantin