Sciweavers

2465 search results - page 170 / 493
» Automata on Linear Orderings
Sort
View
CADE
2002
Springer
14 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
IWANN
1995
Springer
14 years 1 months ago
EL-SIM: a Development Environment for Neuro-Fuzzy Intelligent Controllers
1 This paper presents a new technique for the design of real-time controllers based on a hybrid approach which integrates several control strategies, such as intelligent controlle...
Marcello Chiaberge, G. Di Bene, S. Di Pascoli, R. ...
STRINGOLOGY
2008
13 years 11 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
CPC
2004
92views more  CPC 2004»
13 years 10 months ago
Large Topological Cliques in Graphs Without a 4-Cycle
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
Daniela Kühn, Deryk Osthus
PARELEC
2006
IEEE
14 years 4 months ago
Hierarchical Partitioning for Piecewise Linear Algorithms
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...
Hritam Dutta, Frank Hannig, Jürgen Teich