Sciweavers

636 search results - page 38 / 128
» Measuring Complexity of Intelligent Machines
Sort
View
93
Voted
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
15 years 3 months ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer
CEC
2008
IEEE
15 years 4 months ago
DCA for bot detection
Abstract— Ensuring the security of computers is a nontrivial task, with many techniques used by malicious users to compromise these systems. In recent years a new threat has emer...
Yousof Al-Hammadi, Uwe Aickelin, Julie Greensmith
FSTTCS
1992
Springer
15 years 1 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
73
Voted
AAAI
2008
15 years 7 hour ago
Active Learning for Pipeline Models
For many machine learning solutions to complex applications, there are significant performance advantages to decomposing the overall task into several simpler sequential stages, c...
Dan Roth, Kevin Small
PNPM
1989
15 years 1 months ago
SPNP: Stochastic Petri Net Package
We present SPNP, a powerful GSPN package developed at Duke University. SPNP allows the modeling of complex system behaviors. Advanced constructs are available, such as markingdepe...
Gianfranco Ciardo, Jogesh K. Muppala, Kishor S. Tr...