Sciweavers

1887 search results - page 196 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICML
2006
IEEE
14 years 10 months ago
An analytic solution to discrete Bayesian reinforcement learning
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
Pascal Poupart, Nikos A. Vlassis, Jesse Hoey, Kevi...
AI
2009
Springer
14 years 3 months ago
STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...
Wei Gu, Xin Wang, Liqiang Geng
MOBIHOC
2005
ACM
14 years 9 months ago
Timed grid routing (TIGR) bites off energy
Energy efficiency and collisions avoidance are both critical properties to increase the lifetime and effectiveness of wireless networks. This paper proposes a family of algorithms...
Roy Friedman, Guy Korland
WWW
2009
ACM
14 years 10 months ago
Click chain model in web search
Given a terabyte click log, can we build an efficient and effective click model? It is commonly believed that web search click logs are a gold mine for search business, because th...
Anitha Kannan, Chao Liu 0001, Christos Faloutsos, ...
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 10 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis