Sciweavers

944 search results - page 138 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
SARA
2007
Springer
15 years 4 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
IPPS
2006
IEEE
15 years 4 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
PVLDB
2010
129views more  PVLDB 2010»
14 years 8 months ago
Entity Resolution with Evolving Rules
Entity resolution (ER) identifies database records that refer to the same real world entity. In practice, ER is not a one-time process, but is constantly improved as the data, sc...
Steven Whang, Hector Garcia-Molina
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 4 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
KDD
2006
ACM
120views Data Mining» more  KDD 2006»
15 years 10 months ago
Hierarchical topic segmentation of websites
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
Ravi Kumar, Kunal Punera, Andrew Tomkins