Sciweavers

2244 search results - page 167 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
15 years 8 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
HICSS
2006
IEEE
114views Biometrics» more  HICSS 2006»
16 years 1 months ago
A Formal Approach towards Assessing the Effectiveness of Anti-Spam Procedures
Spam e-mails have become a serious technological and economic problem. So far we have been reasonably able to resist spam e-mails and use the Internet for regular communication by...
Guido Schryen
ICML
2006
IEEE
16 years 8 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
ICML
1998
IEEE
16 years 8 months ago
Genetic Programming and Deductive-Inductive Learning: A Multi-Strategy Approach
Genetic Programming (GP) is a machine learning technique that was not conceived to use domain knowledge for generating new candidate solutions. It has been shown that GP can bene ...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 8 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