Sciweavers

3652 search results - page 568 / 731
» A study of query length
Sort
View
COCOA
2007
Springer
16 years 19 days ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
PPOPP
2006
ACM
16 years 13 days ago
Performance characterization of molecular dynamics techniques for biomolecular simulations
Large-scale simulations and computational modeling using molecular dynamics (MD) continues to make significant impacts in the field of biology. It is well known that simulations...
Sadaf R. Alam, Jeffrey S. Vetter, Pratul K. Agarwa...
CCGRID
2005
IEEE
16 years 3 days ago
Mapping DAG-based applications to multiclusters with background workload
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, D...
IPPS
2005
IEEE
16 years 2 days ago
Dynamic RWA Based on the Combination of Mobile Agents Technique and Genetic Algorithm in WDM Networks with Sparse Wavelength Con
In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile ag...
Vinh Trong Le, Xiaohong Jiang, Son-Hong Ngo, Susum...
SIGCOMM
2005
ACM
16 years 1 days ago
Implications of autonomy for the expressiveness of policy routing
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, a...
Nick Feamster, Ramesh Johari, Hari Balakrishnan