Sciweavers

4270 search results - page 4 / 854
» A Permutation Approach to Validation
Sort
View
WG
2005
Springer
14 years 26 days ago
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
Christophe Crespelle, Christophe Paul
MOR
2006
73views more  MOR 2006»
13 years 7 months ago
Permuted Standardized Time Series for Steady-State Simulations
We describe an extension procedure for constructing new standardized time series procedures from existing ones. The approach is based on averaging over sample paths obtained by per...
James M. Calvin, Marvin K. Nakayama
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
13 years 7 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
13 years 11 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
EVOW
2001
Springer
13 years 12 months ago
Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
Marc Bufé, Tim Fischer, Holger Gubbels, Cla...