408 search results - page 22 / 82 » Quantitative Models and Implicit Complexity |
AIPS
2009
13 years 8 months ago
2009
Distributed POMDPs provide an expressive framework for modeling multiagent collaboration problems, but NEXPComplete complexity hinders their scalability and application in real-wo...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
WEBI
2001
Springer
13 years 12 months ago
2001
Springer
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
3DIM
1997
IEEE
13 years 11 months ago
1997
IEEE
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...