Sciweavers

1086 search results - page 38 / 218
» Jug measuring: Algorithms and complexity
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 11 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
14 years 4 months ago
Benefits of software measures for evolutionary white-box testing
White-box testing is an important method for the early detection of errors during software development. In this process test case generation plays a crucial role, defining appropr...
Frank Lammermann, Stefan Wappler
ALT
2002
Springer
14 years 8 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
BIOSYSTEMS
2007
52views more  BIOSYSTEMS 2007»
13 years 11 months ago
The genotypic complexity of evolved fault-tolerant and noise-robust circuits
Noise and component failure is an increasingly difficult problem in modern electronic design. Bioinspired techniques is one approach that is applied in an effort to solve such is...
Morten Hartmann, Pauline C. Haddow, Per Kristian L...
ICML
2007
IEEE
14 years 11 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario