653 search results - page 94 / 131 » Factored Planning: How, When, and When Not |
109
click to vote
SOUPS
2009
ACM
15 years 8 months ago
2009
ACM
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
131
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
128
click to vote
AINA
2007
IEEE
15 years 8 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
113
click to vote
ICON
2007
IEEE
15 years 8 months ago
2007
IEEE
—Data transmission in wireless mesh networks (WMNs) has a multi-hop nature where data is originated/destinated to one source/sink node. Therefore, the transmission capacity at th...
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
For embodied agents to engage in realistic multiparty conversation, they must stand in appropriate places with respect to other agents and the environment. When these factors chan...