Sciweavers

1414 search results - page 119 / 283
» Randomness and Universal Machines
Sort
View
CORR
2004
Springer
137views Education» more  CORR 2004»
13 years 10 months ago
Implementation of Logical Functions in the Game of Life
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
Jean-Philippe Rennard
ICIP
2003
IEEE
14 years 11 months ago
Image features that draw fixations
The ability to automatically detect `visually interesting' regions in an image has many practical applications especially in the design of active machine vision systems. This...
Umesh Rajashekar, Lawrence K. Cormack, Alan C. Bov...
ICRA
2003
IEEE
147views Robotics» more  ICRA 2003»
14 years 3 months ago
Modular petri net based modeling, analysis and synthesis of dedicated production systems
−−−− Ordinary t-timed Petri Nets are used for modeling, analysis and synthesis of random topology production systems and networks. Each production system is first decompose...
George J. Tsinarakis, Kimon P. Valavanis, Nikos Ts...
KBSE
2002
IEEE
14 years 2 months ago
What Makes Finite-State Models More (or Less) Testable?
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
David Owen, Tim Menzies, Bojan Cukic
IJON
2006
78views more  IJON 2006»
13 years 10 months ago
Improving self-organization of document collections by semantic mapping
In text management tasks, the dimensionality reduction becomes necessary to computation and interpretability of the results generated by machine learning algorithms. This paper de...
Renato Fernandes Corrêa, Teresa Bernarda Lud...