Sciweavers

2588 search results - page 115 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
FGCS
2007
125views more  FGCS 2007»
15 years 1 months ago
An autonomic tool for building self-organizing Grid-enabled applications
In this paper we present CAMELotGrid, a tool to manage Grid computations of Cellular Automata that support the efficient simulation of complex systems modeled by a very large numb...
Gianluigi Folino, Giandomenico Spezzano
AUTONOMICS
2008
ACM
15 years 3 months ago
On modeling of self-organizing systems
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...
Richard Holzer, Hermann de Meer
DSN
2004
IEEE
15 years 5 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
HICSS
2003
IEEE
164views Biometrics» more  HICSS 2003»
15 years 7 months ago
From Computer Networks to Agent Networks
From the 1990s on, one of the most important challenges facing computer science researchers has been the design and construction of software tools to exploit Internet computing. A...
Guoqiang Zhong, Kenichi Takahashi, Satoshi Amamiya...
NC
2011
201views Neural Networks» more  NC 2011»
14 years 8 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods