Sciweavers

2584 search results - page 119 / 517
» On the Forward Checking Algorithm
Sort
View
IPL
2002
125views more  IPL 2002»
13 years 7 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
JSC
2006
72views more  JSC 2006»
13 years 8 months ago
Algebraic solutions of holomorphic foliations: An algorithmic approach
We present two algorithms that can be used to check whether a given holomorphic foliation of the projective plane has an algebraic solution, and discuss the performance of their im...
S. C. Coutinho, L. Menasché Schechter
SPIN
2009
Springer
14 years 2 months ago
Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Cha...
JURIX
2008
13 years 9 months ago
An Algorithm for Business Process Compliance
Abstract. This paper provides a novel mechanism to check whether business processes are compliant with business rules regulating them. The key point is that compliance is a relatio...
Guido Governatori, Antonino Rotolo
ACSD
2008
IEEE
102views Hardware» more  ACSD 2008»
14 years 2 months ago
Performing causality analysis by bounded model checking
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...
Klaus Schneider, Jens Brandt