Sciweavers

4313 search results - page 119 / 863
» Using time travel to diagnose computer problems
Sort
View
103
Voted
DAM
2006
106views more  DAM 2006»
15 years 4 months ago
Computational complexity of isothermic DNA sequencing by hybridization
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
Jacek Blazewicz, Marta Kasprzak
IANDC
2007
117views more  IANDC 2007»
15 years 4 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
RTSS
2005
IEEE
15 years 10 months ago
Fast On-the-Fly Parametric Real-Time Model Checking
This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and te...
Dezhuang Zhang, Rance Cleaveland
CCE
2006
15 years 4 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar
130
Voted
IJCAI
1989
15 years 5 months ago
Neural Computing on a One Dimensional SIMD Array
Parallel processors offer a very attractive mechanism for the implementation of large neural networks. Problems in the usage of parallel processing in neural computing involve the...
Stephen S. Wilson