Sciweavers

1806 search results - page 113 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
COMBINATORICS
2007
58views more  COMBINATORICS 2007»
15 years 6 months ago
The Initial Involution Patterns of Permutations
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...
Dongsu Kim, Jang Soo Kim
SIAMCOMP
2008
121views more  SIAMCOMP 2008»
15 years 6 months ago
Closest Substring Problems with Small Distances
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
Dániel Marx
COR
1999
99views more  COR 1999»
15 years 5 months ago
Applications of modern heuristic search methods to pattern sequencing problems
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
Andreas Fink, Stefan Voß
AMAST
2008
Springer
15 years 8 months ago
Service Specification and Matchmaking Using Description Logic
ed Abstract an extended abstract of [11]. Service-oriented computing is emerging as a new paradigm based on autonomous, platform-independent computational entities, called services...
M. Birna van Riemsdijk, Rolf Hennicker, Martin Wir...
MFCS
1998
Springer
15 years 10 months ago
Blockwise Variable Orderings for Shared BDDs
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
Harry Preuß, Anand Srivastav