Sciweavers

3913 search results - page 160 / 783
» complexity 2006
Sort
View
99
Voted
EXPERT
2006
66views more  EXPERT 2006»
15 years 4 months ago
Representation as a Fluent: An AI Challenge for the Next Half Century
We argue that artificial intelligence systems must be able to manipulate their own internal representations automatically in order to deal with an infinitely complex and ever chan...
Alan Bundy, Fiona McNeill
127
Voted
JLP
2006
126views more  JLP 2006»
15 years 4 months ago
Compositional modeling and refinement for hierarchical hybrid systems
In this paper, we develop a theory of modular design and refinement of hierarchical hybrid systems. In particular, we present compositional trace-based semantics for the language ...
Rajeev Alur, Radu Grosu, Insup Lee, Oleg Sokolsky
NA
2006
84views more  NA 2006»
15 years 4 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet
156
Voted
IANDC
2007
117views more  IANDC 2007»
15 years 4 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
IJNS
2000
80views more  IJNS 2000»
15 years 3 months ago
VLSI Implementation of Neural Networks
Currently, fuzzy controllers are the most popular choice for hardware implementation of complex control surfaces because they are easy to design. Neural controllers are more compl...
Bogdan M. Wilamowski, J. Binfet, M. O. Kaynak