Sciweavers

2233 search results - page 135 / 447
» On the Complexity of Theory Curbing
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 12 months 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
IWPSE
2003
IEEE
15 years 11 months ago
The Chaos of Software Development
In this paper we present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory such as Shannon’s Entropy [31]. We...
Ahmed E. Hassan, Richard C. Holt
CHI
1995
ACM
15 years 10 months ago
Belvedere: stimulating students' critical discussion
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...
Massimo Paolucci, Daniel D. Suthers, Arlene Weiner
CAV
2008
Springer
99views Hardware» more  CAV 2008»
15 years 8 months ago
Correcting a Space-Efficient Simulation Algorithm
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
Rob J. van Glabbeek, Bas Ploeger
COMPLEXITY
2004
108views more  COMPLEXITY 2004»
15 years 6 months ago
On the convergence of a factorized distribution algorithm with truncation selection
nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
Qingfu Zhang