14518 search results - page 266 / 2904 » Two Problems for Sophistication |
151
Voted
CIA
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Evaluations of distances or similarity measurements are very important in cooperative problem solving with multiple agents. Distance between problems is used by agents to...
148
click to vote
AAAI
1998
15 years 7 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
151
Voted
EOR
2010
15 years 5 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
270
Voted
MST
2011
14 years 8 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
166
click to vote
CSR
2009
Springer
16 years 5 days ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...