1184 search results - page 110 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
139
click to vote
ISPD
2003
ACM
15 years 10 months ago
2003
ACM
In 21st-Century VLSI design, clocking plays crucial roles for both performance and timing convergence. Due to their non-convex nature, optimal minimum-delay/area zero-skew wire-si...
138
click to vote
FPL
2009
Springer
15 years 9 months ago
2009
Springer
The creation and optimization of FPGA accelerators comprising several compute cores and memories are challenging tasks in high performance reconfigurable computing. In this paper...
121
click to vote
ANOR
2010
15 years 4 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
170
click to vote
FLAIRS
2008
15 years 7 months ago
2008
Naive Bayesian classifiers work well in data sets with independent attributes. However, they perform poorly when the attributes are dependent or when there are one or more irrelev...
118
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...