Sciweavers

8016 search results - page 1243 / 1604
» On the practical genetic algorithms
Sort
View
172
Voted
CCS
2008
ACM
15 years 8 months ago
Towards experimental evaluation of code obfuscation techniques
While many obfuscation schemes proposed, none of them satisfy any strong definition of obfuscation. Furthermore secure generalpurpose obfuscation algorithms have been proven to be...
Mariano Ceccato, Massimiliano Di Penta, Jasvir Nag...
CIKM
2008
Springer
15 years 8 months ago
Proactive learning: cost-sensitive active learning with multiple imperfect oracles
Proactive learning is a generalization of active learning designed to relax unrealistic assumptions and thereby reach practical applications. Active learning seeks to select the m...
Pinar Donmez, Jaime G. Carbonell
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
15 years 8 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
AAAI
2010
15 years 8 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
AAAI
2010
15 years 8 months ago
Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
Kevin Regan, Craig Boutilier
« Prev « First page 1243 / 1604 Last » Next »