Sciweavers

1651 search results - page 87 / 331
» Measuring the Complexity of Classification Problems
Sort
View
IJON
2008
133views more  IJON 2008»
13 years 6 months ago
A multi-objective approach to RBF network learning
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
Illya Kokshenev, Antônio de Pádua Bra...
CG
2010
Springer
13 years 6 months ago
The effect of task on classification accuracy: Using gesture recognition techniques in free-sketch recognition
Generating, grouping, and labeling free-sketch data is a difficult and time-consuming task for both user study participants and researchers. To simplify this process for both part...
M. Field, S. Gordon, Eric Jeffrey Peterson, R. Rob...
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
Multiple resolution of the modular structure of complex networks
Modular structure is ubiquitous in real-world complex networks. The detection of this type of organization into modules gives insights in the relationship between topological stru...
Alex Arenas, Alberto Fernández, Sergio G&oa...
ATAL
2008
Springer
13 years 9 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 7 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter