Sciweavers

1984 search results - page 286 / 397
» Variable mesh optimization for continuous optimization probl...
Sort
View
CC
2005
Springer
115views System Software» more  CC 2005»
15 years 8 months ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...
95
Voted
UC
2005
Springer
15 years 8 months ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
15 years 6 months ago
Minimum area retiming with equivalent initial states
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
Naresh Maheshwari, Sachin S. Sapatnekar
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
15 years 6 months ago
Design tool solutions for mixed-signal/RF circuit design in CMOS nanometer technologies
The scaling of CMOS technology into the nanometer era enables the fabrication of highly integrated systems, which increasingly contain analog and/or RF parts. However, scaling into...
Georges G. E. Gielen
102
Voted
CORR
2010
Springer
70views Education» more  CORR 2010»
15 years 2 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach