Sciweavers

1220 search results - page 201 / 244
» Minimal Interval Completions
Sort
View
CGF
2000
97views more  CGF 2000»
13 years 7 months ago
Collaboration between Heterogeneous Stand-alone 3-D Graphical Applications
We describe the Scene-Graph-As-Bus technique (SGAB), the first step in a staircase of solutions for sharing software components for virtual environments. The goals of SGAB are to ...
Robert C. Zeleznik, Loring Holden, Michael V. Capp...
CLUSTER
2000
IEEE
13 years 7 months ago
Block-cyclic redistribution over heterogeneous networks
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...
Prashanth B. Bhat, Viktor K. Prasanna, Cauligi S. ...
COR
2007
157views more  COR 2007»
13 years 7 months ago
A decision support system for the single-depot vehicle rescheduling problem
Disruptions in trips can prevent vehicles from executing their schedules as planned. Mechanical failures, accidents, and traffic congestion often hinder a vehicle schedule. When a...
Jing-Quan Li, Denis Borenstein, Pitu B. Mirchandan...
IJCM
2002
92views more  IJCM 2002»
13 years 7 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
TCS
1998
13 years 7 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...