1071 search results - page 76 / 215 » Theories of Automatic Structures and Their Complexity |
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
IJCAI
2007
13 years 9 months ago
2007
A key problem in playing strategy games is learning how to allocate resources effectively. This can be a difficult task for machine learning when the connections between actions a...