Sciweavers

3265 search results - page 268 / 653
» Representing Groups on Graphs
Sort
View
APSEC
1997
IEEE
15 years 11 months ago
A Test-case Generation Method for Concurrent Programs Including Task-types
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated taskinstances may not ...
Tetsuro Katayama, Zengo Furukawa, Kazuo Ushijima
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
APVIS
2001
15 years 8 months ago
Information Visualization of Attributed Relational Data
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
Mao Lin Huang
CATA
2003
15 years 8 months ago
More Accurate Semantics Defining Constraint Combination for Software Systems Having Client-Server Relationships
In this paper we present a new method of combining multiple precedence constraints for a single task to support software systems having client-server relationships. In these types...
Kenneth G. Ricks, David Jeff Jackson, B. Earl Well...
NETWORKS
2002
15 years 6 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin