Sciweavers

2214 search results - page 259 / 443
» complexity 2004
Sort
View
ATAL
2004
Springer
15 years 10 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
ER
2004
Springer
219views Database» more  ER 2004»
15 years 10 months ago
An Agent-Based Approach for Interleaved Composition and Execution of Web Services
The emerging paradigm of web services promises to bring to distributed computing the same flexibility that the web has brought to the publication and search of information contain...
Xiaocong Fan, Karthikeyan Umapathy, John Yen, Sand...
144
Voted
ENC
2004
IEEE
15 years 8 months ago
Graph-Based Point Relaxation for 3D Stippling
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
Oscar Meruvia Pastor, Thomas Strotthote
JCS
2008
109views more  JCS 2008»
15 years 4 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
MOBICOM
2004
ACM
15 years 10 months ago
Initializing newly deployed ad hoc and sensor networks
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer