10988 search results - page 293 / 2198 » Algorithmic Folding Complexity |
150
click to vote
CMSB
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
151
click to vote
IJCNN
2000
IEEE
15 years 8 months ago
2000
IEEE
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...
145
click to vote
AAAI
2008
15 years 6 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
132
click to vote
ALGOSENSORS
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
120
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Physical agents (such as wheeled vehicles, UAVs, hovercraft, etc.) with simple control systems are often sensitive to changes in their physical design and control parameters. As s...