16666 search results - page 231 / 3334 » Descriptive and Computational Complexity |
137
click to vote
SAGA
2007
Springer
16 years 20 days ago
2007
Springer
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
134
click to vote
MCU
2007
15 years 8 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
169
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
196
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
188
click to vote
IJRR
2006
15 years 6 months ago
2006
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...