20294 search results - page 147 / 4059 » Algorithmic Information Theory |
115
Voted
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
128
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
138
click to vote
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
119
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
149
click to vote
SSS
2009
Springer
15 years 11 months ago
2009
Springer
High-interaction honeypots are relevant to provide rich and useful information obtained from attackers. Honeypots come in different flavors with respect to their interaction pote...