Sciweavers

233 search results - page 35 / 47
» On Some Optimization Heuristics for Lesk-Like WSD Algorithms
Sort
View
TKDE
2012
199views Formal Methods» more  TKDE 2012»
13 years 2 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
98
Voted
NIPS
1998
15 years 1 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
TCAD
2008
128views more  TCAD 2008»
14 years 11 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
WWW
2008
ACM
16 years 11 days ago
Improving web spam detection with re-extracted features
Web spam detection has become one of the top challenges for the Internet search industry. Instead of using some heuristic rules, we propose a feature re-extraction strategy to opt...
Guanggang Geng, Chunheng Wang, Qiudan Li
EVOW
2010
Springer
15 years 6 months ago
Gaussian Adaptation Revisited - An Entropic View on Covariance Matrix Adaptation
Abstract. We revisit Gaussian Adaptation (GaA), a black-box optimizer for discrete and continuous problems that has been developed in the late 1960’s. This largely neglected sear...
Christian L. Müller, Ivo F. Sbalzarini