Sciweavers

516 search results - page 36 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
EURASIP
1990
14 years 1 months ago
Inversion in Time
Inversionof multilayersynchronous networks is a method which tries to answer questions like What kind of input will give a desired output?" or Is it possible to get a desired...
Sebastian Thrun, Alexander Linden
COMPGEOM
2006
ACM
14 years 3 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
SCL
2008
82views more  SCL 2008»
13 years 9 months ago
An efficient algorithm for positive realizations
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions...
Wojciech Czaja, Philippe Jaming, Máté...
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 10 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 4 months ago
Robust multi-cellular developmental design
This paper introduces a continuous model for Multi-cellular Developmental Design. The cells are fixed on a 2D grid and exchange ”chemicals” with their neighbors during the gr...
Alexandre Devert, Nicolas Bredeche, Marc Schoenaue...