8824 search results - page 377 / 1765 » On the Complexity of Real Functions |
213
click to vote
SMA
2003
ACM
16 years 25 days ago
2003
ACM
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
191
Voted
FOCS
1999
IEEE
15 years 12 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
221
Voted
SAT
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
236
Voted
DAC
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents new technology that accelerates system verification. Traditional methods for verifying functional designs are based on logic simulation, which becomes more tim...
183
Voted
VLDB
1987
ACM
15 years 11 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...