Sciweavers

2080 search results - page 41 / 416
» Measuring empirical computational complexity
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 3 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
ICCSA
2003
Springer
14 years 3 months ago
Complex Dynamics and Financial Fragility in an Agent Based Model
In this paper, we model an agent-based economy in which heterogeneous agents (firms and a bank) interact in the financial markets. The heterogeneity is due to the balance sheet ...
Mauro Gallegati, Gianfranco Giulioni, Nozomi Kichi...
ECCV
2010
Springer
14 years 3 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
CONEXT
2007
ACM
14 years 1 months ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt
DCC
2006
IEEE
14 years 9 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley