5316 search results - page 114 / 1064 » Which Search Problems Are Random |
122
Voted
AAAI
1998
15 years 4 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
112
click to vote
CP
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
126
click to vote
ICCS
2001
Springer
15 years 7 months ago
2001
Springer
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomiz...
125
Voted
FOCM
2007
15 years 3 months ago
2007
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
103
Voted
RSA
1998
15 years 3 months ago
1998
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...