7106 search results - page 416 / 1422 » Restricted Complexity, General Complexity |
213
click to vote
ATAL
2005
Springer
16 years 26 days ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
200
click to vote
GECCO
2005
Springer
16 years 25 days ago
2005
Springer
The need to build modular, scalable, and complex technology capable of adaptation, self-assembly, and self-repair has fuelled renewed interest in using approaches inspired by deve...
192
click to vote
ICALP
2005
Springer
16 years 25 days ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
306
click to vote
ISSTA
2004
ACM
16 years 23 days ago
2004
ACM
We show how model checking and symbolic execution can be used to generate test inputs to achieve structural coverage of code that manipulates complex data structures. We focus on ...
211
click to vote
MM
2004
ACM
16 years 23 days ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...