Sciweavers

18451 search results - page 3443 / 3691
» Selecting a Selection Procedure
Sort
View
CGO
2004
IEEE
15 years 10 months ago
Custom Data Layout for Memory Parallelism
In this paper, we describe a generalized approach to deriving a custom data layout in multiple memory banks for array-based computations, to facilitate high-bandwidth parallel mem...
Byoungro So, Mary W. Hall, Heidi E. Ziegler
ATAL
2006
Springer
15 years 10 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
ATAL
2006
Springer
15 years 10 months ago
Teaching new teammates
Knowledge transfer between expert and novice agents is a challenging problem given that the knowledge representation and learning algorithms used by the novice learner can be fund...
Doran Chakraborty, Sandip Sen
ATAL
2006
Springer
15 years 10 months ago
RPD-enabled agents teaming with humans for multi-context decision making
Team decision making under stress involving multiple contexts is an extremely challenging issue faced by various real world application domains. This research is targeted at coupl...
Xiaocong Fan, Bingjun Sun, Shuang Sun, Michael D. ...
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 10 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
« Prev « First page 3443 / 3691 Last » Next »