1101 search results - page 61 / 221 » Comparing Computer Models Solving Number Series Problems |
101
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
89
Voted
IWOCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
131
Voted
IIS
2003
15 years 2 months ago
2003
Abstract. The problem of parallel and distributed function optimization with coevolutionary algorithms is considered. Two coevolutionary algorithms are used for this purpose and co...
93
Voted
COLING
2010
14 years 8 months ago
2010
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer pro...
132
Voted
CVPR
2004
IEEE
15 years 4 months ago
2004
IEEE
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphi...