Sciweavers

3244 search results - page 189 / 649
» On convex complexity measures
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 1 days ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon
CSMR
1998
IEEE
15 years 10 months ago
A Metrics Suite for Concurrent Logic Programs
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
Jianjun Zhao, Jingde Cheng, Kazuo Ushijima
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
15 years 6 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
JMLR
2002
74views more  JMLR 2002»
15 years 6 months ago
The Representational Power of Discrete Bayesian Networks
One of the most important fundamental properties of Bayesian networks is the representational power, reflecting what kind of functions they can or cannot represent. In this paper,...
Charles X. Ling, Huajie Zhang
ICPR
2008
IEEE
16 years 7 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson