17541 search results - page 427 / 3509 » Complexity in scalable computing |
153
click to vote
AIIA
2001
Springer
15 years 10 months ago
2001
Springer
This paper briefly describes a scalable architecture for implementing autonomous agents that act in a virtual world created for a computer game and must interact with it by suitabl...
137
click to vote
CIE
2007
Springer
16 years 9 days ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
146
click to vote
COLING
1992
15 years 7 months ago
1992
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and...
206
click to vote
LICS
2012
IEEE
13 years 8 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
145
click to vote
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
16 years 27 days ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...