Sciweavers

1404 search results - page 270 / 281
» On General Laws of Complex Networks
Sort
View
SPAA
2009
ACM
14 years 2 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
KDD
2009
ACM
160views Data Mining» more  KDD 2009»
14 years 2 months ago
Clustering event logs using iterative partitioning
The importance of event logs, as a source of information in systems and network management cannot be overemphasized. With the ever increasing size and complexity of today’s even...
Adetokunbo Makanju, A. Nur Zincir-Heywood, Evangel...
IPPS
2007
IEEE
14 years 1 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
IUI
2006
ACM
14 years 1 months ago
Who's asking for help?: a Bayesian approach to intelligent assistance
Automated software customization is drawing increasing attention as a means to help users deal with the scope, complexity, potential intrusiveness, and ever-changing nature of mod...
Bowen Hui, Craig Boutilier