Sciweavers

620 search results - page 79 / 124
» Algorithms and computations on cellular automata
Sort
View
WS
2004
ACM
15 years 6 months ago
JANUS: towards robust and malicious resilient routing in hybrid wireless networks
In this paper we investigate and provide solutions for security threats in the context of hybrid networks consisting of a cellular base station and mobile devices equipped with du...
Bogdan Carbunar, Ioannis Ioannidis, Cristina Nita-...
109
Voted
TIME
2007
IEEE
15 years 6 months ago
A Symbolic Decision Procedure for Robust Safety of Timed Systems
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
Mani Swaminathan, Martin Fränzle
FCT
1991
Springer
15 years 4 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
97
Voted
CANDC
2005
ACM
15 years 2 months ago
Exhibition: computational schemes for biomimetic sculpture
The Mid-Ocean Studio, Brown University’s SHAPE lab, and Goldsmiths College are collaborating on a prototype system for the automatic evolution of biomimetic sculpture using stru...
Brower Hatcher, Karl Aspelund, Andrew R. Willis, J...
100
Voted
JIIS
2008
89views more  JIIS 2008»
15 years 17 days ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag