Sciweavers

2778 search results - page 11 / 556
» Limit complexities revisited
Sort
View
TEC
2010
184views more  TEC 2010»
14 years 4 months ago
Automatic Reproduction of a Genius Algorithm: Strassen's Algorithm Revisited by Genetic Search
Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n
Seunghyun Oh, Byung-Ro Moon
STACS
2010
Springer
15 years 4 months ago
Revisiting the Rice Theorem of Cellular Automata
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
Pierre Guillon, Gaétan Richard
HYBRID
2000
Springer
15 years 1 months ago
Dynamical Systems Revisited: Hybrid Systems with Zeno Executions
Results from classical dynamical systems are generalized to hybrid dynamical systems. The concept of limit set is introduced for hybrid systems and is used to prove new results on...
Jun Zhang, Karl Henrik Johansson, John Lygeros, Sh...
AMW
2010
14 years 11 months ago
Minimising RDF Graphs under Rules and Constraints Revisited
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
SMC
2007
IEEE
122views Control Systems» more  SMC 2007»
15 years 4 months ago
Can complexity science support the engineering of critical network infrastructures?
— Considerable attention is now being devoted to the study of “complexity science” with the intent of discovering and applying universal laws of highly interconnected and evo...
David Alderson, John C. Doyle