Sciweavers

1968 search results - page 232 / 394
» The Complexity of Valued Constraint Models
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 2 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
FPGA
2010
ACM
250views FPGA» more  FPGA 2010»
15 years 10 months ago
Variation-aware placement for FPGAs with multi-cycle statistical timing analysis
Deep submicron processes have allowed FPGAs to grow in complexity and speed. However, such technology scaling has caused FPGAs to become more susceptible to the effects of process...
Gregory Lucas, Chen Dong, Deming Chen
ICC
2007
IEEE
100views Communications» more  ICC 2007»
15 years 8 months ago
Optimal Power Allocation in SVD Equalized Multicarrier Systems
Abstract— Multicarrier transmission is an established technique for radio transmission systems and it can be considered as a promising approach for next generation wireless syste...
Andreas Ahrens, Christoph Lange, Volker Kühn,...
ICMCS
2005
IEEE
111views Multimedia» more  ICMCS 2005»
15 years 7 months ago
Optimized wireless video transmission using classification
— Cross protocol layer optimizations have been recently proposed for improving the performance of realtime video transmission over 802.11 WLANs. However, performing such cross-la...
Raymond S. Wong, Mihaela van der Schaar, Deepak S....
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
15 years 7 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...