1532 search results - page 91 / 307 » The Symbol Grounding Problem |
131
click to vote
EUROCAST
2005
Springer
15 years 9 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
154
click to vote
SEMWEB
2010
Springer
15 years 2 months ago
2010
Springer
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
132
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
146
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
127
click to vote
ICMS
2010
15 years 2 months ago
2010
Abstract. Most optimization software performs numerical computation, in the sense that the main interest is to find numerical values to assign to the decision variables, e.g. a so...