Sciweavers

69 search results - page 4 / 14
» Goal Achievement in Partially Known, Partially Observable Do...
Sort
View
ALT
2002
Springer
14 years 3 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
IPPS
2005
IEEE
14 years 17 days ago
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
Chih-fan Hsin, Mingyan Liu
ANTSW
2006
Springer
13 years 10 months ago
Negotiation of Goal Direction for Cooperative Transport
In this paper, we study the cooperative transport of a heavy object by a group of robots towards a goal. We investigate the case in which robots have partial and noisy knowledge of...
Alexandre Campo, Shervin Nouyan, Mauro Birattari, ...
DAC
2012
ACM
11 years 9 months ago
WCET-centric partial instruction cache locking
Caches play an important role in embedded systems by bridging the performance gap between high speed processors and slow memory. At the same time, caches introduce imprecision in ...
Huping Ding, Yun Liang, Tulika Mitra
AAAI
1990
13 years 8 months ago
Negotiation and Conflict Resolution in Non-Cooperative Domains
In previous work [Zlotkin and Rosenschein, 1989a], we have developed a negotiation protocol and offered some negotiation strategies that are in equilibrium. This negotiation proce...
Gilad Zlotkin, Jeffrey S. Rosenschein