Sciweavers

666 search results - page 70 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
SPAA
1999
ACM
14 years 1 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 2 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 9 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
NCA
2006
IEEE
13 years 9 months ago
Open-loop regulation and tracking control based on a genealogical decision tree
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
Kaddour Najim, Enso Ikonen, P. Del Moral
MFCS
2007
Springer
14 years 3 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten