Sciweavers

2080 search results - page 352 / 416
» Measuring empirical computational complexity
Sort
View
EPEW
2007
Springer
16 years 10 days ago
Towards an Automatic Modeling Tool for Observed System Behavior
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of capa...
Thomas Begin, Alexandre Brandwajn, Bruno Baynat, B...
EVOW
2007
Springer
16 years 10 days ago
Unsupervised Evolutionary Segmentation Algorithm Based on Texture Analysis
Abstract. This work describes an evolutionary approach to texture segmentation, a long-standing and important problem in computer vision. The difficulty of the problem can be relat...
Cynthia B. Pérez, Gustavo Olague
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 10 days ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
MDM
2007
Springer
16 years 9 days ago
Near Optimal Update-Broadcast of Data Sets
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg
SRDS
2006
IEEE
16 years 5 days ago
Topology Sensitive Replica Selection
As the disks typically found in personal computers grow larger, protecting data by replicating it on a collection of “peer” systems rather than on dedicated high performance s...
Dmitry Brodsky, Michael J. Feeley, Norman C. Hutch...