392 search results - page 74 / 79 » Maximal Completion |
ASPLOS
2008
ACM
13 years 9 months ago
2008
ACM
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
IJCAI
2007
13 years 9 months ago
2007
We study the bidding behavior of spiteful agents who, contrary to the common assumption of selfinterest, maximize a convex combination of their own proļ¬t and their competitorsā...
NIPS
2001
13 years 9 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...