Sciweavers

168 search results - page 31 / 34
» On Nontrivial Approximation of CSPs
Sort
View
IWMM
2007
Springer
110views Hardware» more  IWMM 2007»
14 years 4 months ago
Path: page access tracking to improve memory management
Traditionally, operating systems use a coarse approximation of memory accesses to implement memory management algorithms by monitoring page faults or scanning page table entries. ...
Reza Azimi, Livio Soares, Michael Stumm, Thomas Wa...
FOCS
2006
IEEE
14 years 4 months ago
Lower Bounds for Additive Spanners, Emulators, and More
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
David P. Woodruff
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
SMA
2005
ACM
132views Solid Modeling» more  SMA 2005»
14 years 3 months ago
Simplified engineering analysis via medial mesh reduction
Numerous simplification methods have been proposed for speeding up engineering analysis/ simulation. A recently proposed medial axis reduction is one such method, that is particul...
Murari Sinha, Krishnan Suresh
CDC
2009
IEEE
176views Control Systems» more  CDC 2009»
14 years 3 months ago
Controllability of the rotation of a quantum planar molecule
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...
Ugo V. Boscain, Thomas Chambrion, Paolo Mason, Mar...