Sciweavers

1418 search results - page 232 / 284
» Schema polynomials and applications
Sort
View
STACS
2009
Springer
15 years 6 months ago
Hardness and Algorithms for Rainbow Connectivity
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
15 years 6 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
VMCAI
2009
Springer
15 years 6 months ago
Extending Symmetry Reduction by Exploiting System Architecture
Abstract. Symmetry reduction is a technique to alleviate state explosion in model checking by replacing a model of replicated processes with a bisimilar quotient model. The size of...
Richard J. Trefler, Thomas Wahl
GLVLSI
2009
IEEE
131views VLSI» more  GLVLSI 2009»
15 years 6 months ago
Octilinear redistributive routing in bump arrays
This paper proposes a scheme for automatic re-distribution layer (RDL) routing, which is used in chip-package connections. Traditional RDL routing designs are mostly performed man...
Renshen Wang, Chung-Kuan Cheng
APPT
2009
Springer
15 years 6 months ago
Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...
Christoph Bosshard, Roland Bouffanais, Christian C...