1225 search results - page 30 / 245 » Maximal Consistent Subsets |
ICMS
2010
13 years 5 months ago
2010
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in t...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
CLEIEJ
2007
13 years 7 months ago
2007
This work presents proof rules for termination and non-termination for a subset of a C-like language that consists of the statements : assignation, composition, if, skip and while...