Sciweavers

10988 search results - page 1920 / 2198
» Algorithmic Folding Complexity
Sort
View
ATAL
2008
Springer
15 years 6 months ago
Robust and efficient plan recognition for dynamic multi-agent teams
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
Gita Sukthankar, Katia P. Sycara
ATAL
2008
Springer
15 years 6 months ago
Reinforcement learning for DEC-MDPs with changing action sets and partially ordered dependencies
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
Thomas Gabel, Martin A. Riedmiller
AUSDM
2008
Springer
237views Data Mining» more  AUSDM 2008»
15 years 6 months ago
On Inconsistencies in Quantifying Strength of Community Structures
Complex network analysis involves the study of the properties of various real world networks. In this broad field, research on community structures forms an important sub area. Th...
Wen Haw Chong
ISQED
2010
IEEE
156views Hardware» more  ISQED 2010»
15 years 6 months ago
On the design of different concurrent EDC schemes for S-Box and GF(p)
Recent studies have shown that an attacker can retrieve confidential information from cryptographic hardware (e.g. the secret key) by introducing internal faults. A secure and re...
Jimson Mathew, Hafizur Rahaman, Abusaleh M. Jabir,...
ITP
2010
178views Mathematics» more  ITP 2010»
15 years 6 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
« Prev « First page 1920 / 2198 Last » Next »