Sciweavers

Share
7 search results - page 1 / 2
» A recursive paradigm to solve Boolean relations
Sort
View
DAC
2004
ACM
10 years 28 days ago
A recursive paradigm to solve Boolean relations
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
David Bañeres, Jordi Cortadella, Michael Ki...
EVOW
1994
Springer
9 years 4 months ago
Genetic Approaches to Learning Recursive Relations
The genetic programming (GP) paradigm is a new approach to inductively forming programs that describe a particular problem. The use of natural selection based on a fitness ]unction...
Peter A. Whigham, Robert I. McKay
APAL
2008
87views more  APAL 2008»
9 years 2 days ago
Characterising nested database dependencies by fragments of propositional logic
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
Sven Hartmann, Sebastian Link
RAS
2010
117views more  RAS 2010»
8 years 10 months ago
Extending BDI plan selection to incorporate learning from experience
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI exe...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
SPIN
2010
Springer
8 years 10 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric
books