3495 search results - page 247 / 699 » On the random satisfiable process |
183
click to vote
FLAIRS
2008
15 years 9 months ago
2008
To facilitate more meaningful interpretation considering the internal interdependency relationships between data values, a new form of high-order (multiple-valued) pattern known a...
212
click to vote
CCS
2008
ACM
15 years 9 months ago
2008
ACM
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 80056A sta...
180
click to vote
SIROCCO
2008
15 years 8 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
206
click to vote
AAAI
2004
15 years 8 months ago
2004
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
191
click to vote
IADIS
2004
15 years 8 months ago
2004
The study on the topological structure of the Internet is very important for the simulation and the protocol design of the Internet. In recent years, some researchers have made pr...