Wyniki wyszukiwania:

This book studies two optimization problems, maximum satisfiability and planing of satisfiability. The maximum satisfiability problem (max-SAT) is the optimization counterpart of the satisfiability problem (SAT). The goal of max-SAT is to maximize the number of clauses satisfied. planning as satisfiability is a class of planning aiming to achieve a plan with optimal resource, cost, or makespan by using the SAT approach. We present a mix- SAT formulation for these two optimization problems and examine to extend the Davis-Putnam-Logemann- Loveland (DPLL) procedure, which is the basic framework...

This book constitutes the refereed proceedings of the 8th IAPR International Conference on Pattern Recognition in Bioinformatics, PRIB 2013, held in Nice, France, in June 2013. The 25 revised full papers presented were carefully reviewed and selected from 43 submissions. The papers are organized in topical sections on bio-molecular networks and pathway analysis; learning, classification, and clustering; data mining and knowledge discovery; protein: structure, function, and interaction; motifs, sites, and sequence analysis.