14699 search results - page 272 / 2940 » Complexity and Cognitive Computing |
141
click to vote
WM
2003
15 years 5 months ago
2003
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
131
click to vote
SOFSEM
2009
Springer
16 years 1 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
149
Voted
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
130
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
127
Voted
CSR
2006
Springer
15 years 7 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...