Sciweavers

3047 search results - page 62 / 610
» Randomized Parallel Selection
Sort
View
ACMICEC
2007
ACM
117views ECommerce» more  ACMICEC 2007»
13 years 11 months ago
Selectively acquiring ratings for product recommendation
Accurate prediction of customer preferences on products is the key to any recommender systems to realize its promised strategic values such as improved customer satisfaction and t...
Zan Huang
IPPS
1998
IEEE
13 years 12 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
PODC
1999
ACM
14 years 22 hour ago
Analysis of Timing-Based Mutual Exclusion with Random Times
Various timing-based mutualexclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorith...
Eli Gafni, Michael Mitzenmacher
COLCOM
2007
IEEE
13 years 9 months ago
A random projection approach to subscription covering detection in publish/subscribe systems
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
Duc A. Tran, Thinh Nguyen
CIG
2005
IEEE
14 years 1 months ago
Combining Tactical Search and Monte-Carlo in the Game of Go
We present a way to integrate search and Monte-Carlo methods in the game of Go. Our program uses search to find the status of tactical goals, builds groups, selects interesting go...
Tristan Cazenave, Bernard Helmstetter