Sciweavers

2080 search results - page 11 / 416
» Measuring empirical computational complexity
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
Complex Network Measurements: Estimating the Relevance of Observed Properties
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
Matthieu Latapy, Clémence Magnien
CLIMA
2010
13 years 10 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
LPAR
2004
Springer
14 years 3 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
CHI
2005
ACM
14 years 10 months ago
An empirical assessment of adaptation techniques
The effectiveness of adaptive user interfaces highly depends on the how accurately adaptation satisfies the needs of users. This paper presents an empirical study that examined tw...
Theophanis Tsandilas, Monica M. C. Schraefel
ATAL
2010
Springer
13 years 11 months ago
Strategy exploration in empirical games
Empirical analyses of complex games necessarily focus on a restricted set of strategies, and thus the value of empirical game models depends on effective methods for selectively e...
Patrick R. Jordan, L. Julian Schvartzman, Michael ...