Sciweavers

2492 search results - page 326 / 499
» On the General Signature Trees
Sort
View
ISAAC
2001
Springer
104views Algorithms» more  ISAAC 2001»
15 years 10 months ago
Algorithms for Pattern Involvement in Permutations
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
Michael H. Albert, Robert E. L. Aldred, Mike D. At...
PADL
2001
Springer
15 years 10 months ago
Interoperability between Bioinformatics Tools: A Logic Programming Approach
The goal of this project is to develop solutions to enhance interoperability between bioinformatics applications. Most existing applications adopt different data formats, forcing ...
Juan Raymundo Iglesias, Gopal Gupta, Enrico Pontel...
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
15 years 10 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret
DATE
2000
IEEE
83views Hardware» more  DATE 2000»
15 years 10 months ago
Predicting Coupled Noise in RC Circuits
A novel method which can be regarded as the noisecounterpart of the celebrated Elmore’s delay formula— both being based on the first two moments of the network’s transfer fu...
Bernard N. Sheehan
KBSE
2000
IEEE
15 years 10 months ago
Practical Large Scale What-If Queries: Case Studies with Software Risk Assessment
When a lack of data inhibits decision making, large scale what-if queries can be conducted over the uncertain parameter ranges. Such what-if queries can generate an overwhelming a...
Tim Menzies, Erik Sinsel