Sciweavers

10493 search results - page 199 / 2099
» Dynamic Word Problems
Sort
View
JUCS
2008
158views more  JUCS 2008»
13 years 8 months ago
A Linear Time Approximation Algorithm for Ruler Folding Problem
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
Ali Nourollah, Mohammadreza Razzazi
MST
2006
129views more  MST 2006»
13 years 8 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
SIAMDM
2008
139views more  SIAMDM 2008»
13 years 8 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 8 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
IPM
2002
102views more  IPM 2002»
13 years 8 months ago
Problems of music information retrieval in the real world
Although a substantial number of research projects have addressed music information retrieval over the past three decades, the field is still very immature. Few of these projects ...
Donald Byrd, Tim Crawford