5316 search results - page 64 / 1064 » Which Search Problems Are Random |
106
click to vote
CORR
2010
Springer
15 years 27 days ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
113
click to vote
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
101
Voted
JAIR
2007
15 years 21 days ago
2007
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
106
click to vote
SPIN
2009
Springer
15 years 7 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
93
Voted
CEC
2003
IEEE
15 years 6 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...