2080 search results - page 65 / 416 » Measuring empirical computational complexity |
110
click to vote
TCS
2011
14 years 6 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
101
click to vote
ICST
2010
IEEE
14 years 10 months ago
2010
IEEE
—Many factors are believed to increase the vulnerability of software system; for example, the more widely deployed or popular is a software system the more likely it is to be att...
101
click to vote
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
107
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....