Sciweavers

16404 search results - page 171 / 3281
» A set coverage problem
Sort
View
142
Voted
AIPS
2010
15 years 5 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 4 months ago
Combatting financial fraud: a coevolutionary anomaly detection approach
A major difficulty for anomaly detection lies in discovering boundaries between normal and anomalous behavior, due to the deficiency of abnormal samples in the training phase. In...
Shelly Xiaonan Wu, Wolfgang Banzhaf
126
Voted
SIGIR
2008
ACM
15 years 3 months ago
Crosslingual location search
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
Tanuja Joshi, Joseph Joy, Tobias Kellner, Udayan K...
111
Voted
ICML
2006
IEEE
16 years 4 months ago
Learning algorithms for online principal-agent problems (and selling goods online)
In a principal-agent problem, a principal seeks to motivate an agent to take a certain action beneficial to the principal, while spending as little as possible on the reward. This...
Vincent Conitzer, Nikesh Garera
ALMOB
2006
97views more  ALMOB 2006»
15 years 3 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi