Sciweavers

1259 search results - page 95 / 252
» In search of the memoryless property
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 8 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
Association Rules in the Relational Calculus
One of the most utilized data mining tasks is the search for association rules. Association rules represent significant relationships between items in transactions. We extend the...
Oliver Schulte, Flavia Moser, Martin Ester, Zhiyon...
JSW
2008
203views more  JSW 2008»
13 years 7 months ago
Automatic Discovery of Semantic Relations Based on Association Rule
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
Xiangfeng Luo, Kai Yan, Xue Chen
EOR
2007
111views more  EOR 2007»
13 years 7 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
TIP
1998
103views more  TIP 1998»
13 years 7 months ago
Technique for fractal image compression using genetic algorithm
—A new method for fractal image compression is proposed using genetic algorithm (GA) with elitist model. The self transformability property of images is assumed and exploited in ...
Suman K. Mitra, C. A. Murthy, Malay Kumar Kundu