Sciweavers

110 search results - page 21 / 22
» Minimal Partitions Of A Box Into Boxes
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 5 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
ISPD
2009
ACM
112views Hardware» more  ISPD 2009»
14 years 2 months ago
Post-floorplanning power/ground ring synthesis for multiple-supply-voltage designs
The multiple-supply voltage (MSV) design style has been extensively applied to mitigate dynamic-power consumption. The MSV design paradigm, however, brings many crucial challenges...
Wan-Ping Lee, Diana Marculescu, Yao-Wen Chang
FOCS
2007
IEEE
14 years 1 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
IWANN
2009
Springer
14 years 4 days ago
Easing the Smart Home: Translating Human Hierarchies to Intelligent Environments
Abstract. Ubiquitous computing research have extended traditional environments in the so–called Intelligent Environments. All of them use their capabilities for pursuing their in...
Manuel García-Herranz, Pablo A. Haya, Xavie...