2157 search results - page 328 / 432 » Optimal Fast Hashing |
146
Voted
SIAMJO
2010
14 years 9 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
149
click to vote
ICCAD
2007
IEEE
15 years 12 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
155
click to vote
ICCAD
2002
IEEE
15 years 12 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
136
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
In many scientific applications, significant time is spent tuning codes for a particular highperformance architecture. Tuning approaches range from the relatively nonintrusive (...
159
click to vote
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...