Sciweavers

5864 search results - page 63 / 1173
» Can We Work around Numerical Methods
Sort
View
AISC
2006
Springer
15 years 7 months ago
Finding Relations Among Linear Constraints
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
Jun Yan, Jian Zhang, Zhongxing Xu
SIAMSC
2008
149views more  SIAMSC 2008»
15 years 3 months ago
Adaptive Discrete Galerkin Methods Applied to the Chemical Master Equation
In systems biology, the stochastic description of biochemical reaction kinetics is increasingly being employed to model gene regulatory networks and signalling pathways. Mathematic...
Peter Deuflhard, Wilhelm Huisinga, T. Jahnke, Mich...
148
Voted
JCP
2006
91views more  JCP 2006»
15 years 3 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
FLAIRS
2004
15 years 5 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
133
Voted
CVPR
2008
IEEE
16 years 5 months ago
Structure learning in random fields for heart motion abnormality detection
Coronary Heart Disease can be diagnosed by assessing the regional motion of the heart walls in ultrasound images of the left ventricle. Even for experts, ultrasound images are dif...
Glenn Fung, Kevin Murphy, Mark Schmidt, Róm...