1532 search results - page 231 / 307 » The Symbol Grounding Problem |
124
click to vote
UC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
105
click to vote
WIA
2005
Springer
15 years 9 months ago
2005
Springer
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present two important variations on a recently successful bloat control technique, Dynamic Maximum Tree Depth, intended at further improving the results and extending ...
211
click to vote
LICS
2003
IEEE
15 years 9 months ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
112
Voted
CAV
2003
Springer
15 years 9 months ago
2003
Springer
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...