Sciweavers

2588 search results - page 144 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
FUIN
2006
128views more  FUIN 2006»
15 years 1 months ago
A Rewriting Framework for Rule-Based Programming Dynamic Applications
In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting fr...
Anatoly E. Doroshenko, Ruslan Shevchenko
BMCBI
2007
179views more  BMCBI 2007»
15 years 1 months ago
Automated smoother for the numerical decoupling of dynamics models
Background: Structure identification of dynamic models for complex biological systems is the cornerstone of their reverse engineering. Biochemical Systems Theory (BST) offers a pa...
Marco Vilela, Carlos Cristiano H. Borges, Susana V...
SI3D
2006
ACM
15 years 7 months ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 2 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
IPPS
2002
IEEE
15 years 6 months ago
Next Generation System Software for Future High-End Computing Systems
Future high-end computers will offer great performance improvements over today’s machines, enabling applications of far greater complexity. However, designers must solve the cha...
Guang R. Gao, Kevin B. Theobald, Ziang Hu, Haiping...