Sciweavers

8093 search results - page 1294 / 1619
» Design optimization
Sort
View
186
Voted
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
189
Voted
VLSID
2009
IEEE
143views VLSI» more  VLSID 2009»
16 years 7 months ago
SACR: Scheduling-Aware Cache Reconfiguration for Real-Time Embedded Systems
Dynamic reconfiguration techniques are widely used for efficient system optimization. Dynamic cache reconfiguration is a promising approach for reducing energy consumption as well...
Weixun Wang, Prabhat Mishra, Ann Gordon-Ross
CHI
2009
ACM
16 years 7 months ago
Using language tests and emotional expressions to determine the learnability of artificial languages
The study described hereunder lies within the context of a larger project focusing on the design and implementation of a "Robotic Interaction Language". The research goa...
Omar Mubin, Suleman Shahid, Christoph Bartneck, Em...
HPCA
2009
IEEE
16 years 7 months ago
Eliminating microarchitectural dependency from Architectural Vulnerability
The Architectural Vulnerability Factor (AVF) of a hardware structure is the probability that a fault in the structure will affect the output of a program. AVF captures both microa...
Vilas Sridharan, David R. Kaeli
MOBIHOC
2009
ACM
16 years 7 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
« Prev « First page 1294 / 1619 Last » Next »