Sciweavers

3818 search results - page 158 / 764
» Word Problems on Compressed Words
Sort
View
ECCC
2006
99views more  ECCC 2006»
15 years 6 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
JUCS
2006
104views more  JUCS 2006»
15 years 6 months ago
Multi-Objective Evolutionary Algorithms and Pattern Search Methods for Circuit Design Problems
: The paper concerns the design of evolutionary algorithms and pattern search methods on two circuit design problems: the multi-objective optimization of an Operational Transconduc...
Tonio Biondi, Angelo Ciccazzo, Vincenzo Cutello, S...
SIAMSC
2008
142views more  SIAMSC 2008»
15 years 6 months ago
A Fast Direct Solver for the Biharmonic Problem in a Rectangular Grid
We present a fast direct solver methodology for the Dirichlet biharmonic problem in a rectangle. The solver is applicable in the case of the second order Stephenson scheme [34] as ...
Matania Ben-Artzi, Jean-Pierre Croisille, Dalia Fi...
4OR
2004
90views more  4OR 2004»
15 years 6 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
DAM
2000
137views more  DAM 2000»
15 years 5 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...