5316 search results - page 90 / 1064 » Which Search Problems Are Random |
116
click to vote
AI
2005
Springer
15 years 3 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
131
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
141
click to vote
UAI
2000
15 years 4 months ago
2000
Decision theory does not traditionally include uncertainty over utility functions. We argue that the a person's utility value for a given outcome can be treated as we treat o...
132
Voted
AAAI
2011
14 years 3 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
133
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...