1071 search results - page 99 / 215 » Theories of Automatic Structures and Their Complexity |
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
I propose a notion of visual information as the complexity not of the raw images, but of the images after the effects of nuisance factors such as viewpoint and illumination are dis...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...