CPM
2008
Springer
13 years 11 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
CP
2008
Springer
13 years 11 months ago
2008
Springer
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
COORDINATION
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. The notion of session is fundamental in service oriented applications, as it separates interactions between different instances of the same service, and it groups togethe...
CONCUR
2008
Springer
13 years 11 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
ATVA
2008
Springer
13 years 11 months ago
2008
Springer
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
APPT
2007
Springer
13 years 11 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
DILS
2005
Springer
13 years 11 months ago
2005
Springer
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be use...