Sciweavers

2186 search results - page 360 / 438
» Considering an Organization's Memory
Sort
View
EUMAS
2006
15 years 7 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
IJCAI
2001
15 years 7 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
NETWORKING
2004
15 years 7 months ago
An Efficient Probabilistic Packet Marking Scheme for IP Traceback
Abstract. Denial of Service (DoS) attacks represent a major threat to the availability of Internet services. Identifying the sources of these attacks is considered an important ste...
Basheer Al-Duwairi, Anirban Chakrabarti, Govindara...
GRAPHICSINTERFACE
2003
15 years 7 months ago
Texture Partitioning and Packing for Accelerating Texture-based Volume Rendering
To apply empty space skipping in texture-based volume rendering, we partition the texture space with a box-growing algorithm. Each sub-texture comprises of neighboring voxels with...
Wei Li 0004, Arie E. Kaufman
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 7 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine