Sciweavers

150 search results - page 29 / 30
» A Calculus for Relaxed Memory
Sort
View
EMSOFT
2010
Springer
14 years 8 months ago
A unifying view of loosely time-triggered architectures
Abstract--Cyber-Physical Systems require distributed architectures to support safety critical real-time control. Kopetz' Time-Triggered Architectures (TTA) have been proposed ...
Albert Benveniste, Anne Bouillard, Paul Caspi
89
Voted
CP
2009
Springer
14 years 8 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
SIAMJO
2010
87views more  SIAMJO 2010»
14 years 5 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
AIPS
2010
15 years 25 days ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
87
Voted
PLDI
2011
ACM
14 years 1 months ago
Understanding POWER multiprocessors
Exploiting today’s multiprocessors requires highperformance and correct concurrent systems code (optimising compilers, language runtimes, OS kernels, etc.), which in turn requir...
Susmit Sarkar, Peter Sewell, Jade Alglave, Luc Mar...