551 search results - page 5 / 111 » The Complexity of Andersen's Analysis in Practice |
ATAL
2003
Springer
13 years 12 months ago
2003
Springer
Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon fai...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
UAI
2008
13 years 8 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
CSL
2005
Springer
14 years 7 days ago
2005
Springer
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
CSCLP
2005
Springer
14 years 7 days ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...