Sciweavers

4313 search results - page 157 / 863
» Using time travel to diagnose computer problems
Sort
View
GD
2004
Springer
16 years 11 days ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
CP
2007
Springer
15 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
COR
2007
81views more  COR 2007»
15 years 7 months ago
Job scheduling methods for reducing waiting time variance
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
Nong Ye, Xueping Li, Toni Farley, Xiaoyun Xu
GCC
2006
Springer
15 years 10 months ago
Design of Computational Grid-based Intelligence ART1 Classification System for Bioinformatics Applications
Computational Grid technology has been noticed as an issue to solve large-scale bioinformatics-related problems and improves data accuracy and processing speed on multiple computa...
Kyu Cheol Cho, Yong Beom Ma, Jong Sik Lee
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 7 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan