Sciweavers

7988 search results - page 122 / 1598
» A Useful Undecidable Theory
Sort
View
UC
2009
Springer
14 years 4 months ago
Evolvable Hardware: From Applications to Implications for the Theory of Computation
The paper surveys the fundamental principles of evolvable hardware, introduces main problems of the field and briefly describes the most successful applications. Although evolvab...
Lukás Sekanina
ICALT
2006
IEEE
14 years 4 months ago
Evaluation of a Queuing Theory and Systems Modeling Course Based on UML
This paper presents how a new teaching method in the way that a queuing theory and systems modeling or simulation course can be done, was evaluated by the teachers and the student...
Athanasios Perdos, Alexander Chatzigeorgiou, Georg...
AOSE
2003
Springer
14 years 3 months ago
Activity Theory for the Analysis and Design of Multi-agent Systems
This paper shows how to verify a Multi-Agent System specification using human organization metaphors. This proposal applies Activity Theory, which has its roots in Sociology, to st...
Rubén Fuentes, Jorge J. Gómez-Sanz, ...
TACS
2001
Springer
14 years 2 months ago
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
Joachim Niehren, Tim Priesnitz
ISSAC
1998
Springer
111views Mathematics» more  ISSAC 1998»
14 years 2 months ago
A Subresultant Theory for Ore Polynomials with Applications
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
Ziming Li