4377 search results - page 333 / 876 » Mass problems and randomness |
149
click to vote
SARA
2000
Springer
15 years 10 months ago
2000
Springer
In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik's Cube, wi...
153
click to vote
CANS
2008
Springer
15 years 8 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
155
Voted
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
174
click to vote
AAAI
2006
15 years 8 months ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
166
click to vote
EUSFLAT
2001
15 years 8 months ago
2001
In many practical problems, we must combine ("fuse") data represented in different formats, e.g., statistical, fuzzy, etc. The simpler the data, the easier to combine th...