Sciweavers

3068 search results - page 339 / 614
» Clustering with Multiple Graphs
Sort
View
WG
2000
Springer
15 years 10 months ago
Budget Constrained Minimum Cost Connected Medians
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
Goran Konjevod, Sven Oliver Krumke, Madhav V. Mara...
FUIN
2007
79views more  FUIN 2007»
15 years 6 months ago
An Interpretation of Robinson Arithmetic in its Grzegorczyk's Weaker Variant
Q− is a weaker variant of Robinson arithmetic Q in which addition and multiplication are partial functions, i.e. ternary relations that are graphs of possibly non-total function...
Vítezslav Svejdar
180
Voted
JCT
2010
101views more  JCT 2010»
15 years 5 months ago
Asymptotically optimal frugal colouring
We prove that every graph with maximum degree ∆ can be properly (∆ + 1)coloured so that no colour appears more than O(log ∆/ log log ∆) times in the neighbourhood of any v...
Michael Molloy, Bruce A. Reed
TASE
2008
IEEE
15 years 6 months ago
Steady-State Throughput and Scheduling Analysis of Multicluster Tools: A Decomposition Approach
Abstract--Cluster tools are widely used as semiconductor manufacturing equipment. While throughput analysis and scheduling of single-cluster tools have been well-studied, research ...
Jingang Yi, Shengwei Ding, Dezhen Song, Mike Tao Z...
SC
2000
ACM
15 years 11 months ago
From Trace Generation to Visualization: A Performance Framework for Distributed Parallel Systems
In this paper we describe a trace analysis framework, from trace generation to visualization. It includes a unified tracing facility on IBM® SP™ systems, a self-defining interv...
Ching-Farn Eric Wu, Anthony Bolmarcich, Marc Snir,...