1242 search results - page 81 / 249 » A Computational Complexity Theory in Membrane Computing |
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
152
click to vote
GRC
2005
IEEE
15 years 11 months ago
2005
IEEE
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
142
click to vote
DLOG
2006
15 years 7 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
166
click to vote
SIGECOM
2006
ACM
16 years 4 hour ago
2006
ACM
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...