Sciweavers

4930 search results - page 557 / 986
» Testing a Safety-Critical Application
Sort
View
JCC
2008
92views more  JCC 2008»
15 years 7 months ago
Fast procedure for reconstruction of full-atom protein models from reduced representations
: We introduce PULCHRA, a fast and robust method for the reconstruction of full-atom protein models starting from a reduced protein representation. The algorithm is particularly su...
Piotr Rotkiewicz, Jeffrey Skolnick
JCIT
2008
94views more  JCIT 2008»
15 years 7 months ago
Finding Semantic Errors in the Rule-base of Production Systems, and Reasoning with Insufficient Input Data Petri-net-based Appro
Two simple but practical production systems are modeled using Petri Nets. Petri-net models are very useful in finding semantic errors like generalization error and missing conditi...
Hong-Youl Lee
JCT
2008
81views more  JCT 2008»
15 years 7 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
JEA
2008
88views more  JEA 2008»
15 years 7 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
JGAA
2008
97views more  JGAA 2008»
15 years 7 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta