Sciweavers

4488 search results - page 215 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
CP
2005
Springer
15 years 9 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
143
Voted
JOTA
2011
149views more  JOTA 2011»
14 years 11 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
APSEC
2005
IEEE
15 years 9 months ago
CoxR: Open Source Development History Search System
In typical open source software development, developers use revision control systems for product management, mailing list systems for human communications, and bug tracking system...
Makoto Matsushita, Kei Sasaki, Katsuro Inoue
BMCBI
2008
121views more  BMCBI 2008»
15 years 4 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
CP
2004
Springer
15 years 9 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate