Sciweavers

1722 search results - page 115 / 345
» Variables in Concept Graphs
Sort
View
DAC
2009
ACM
15 years 11 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
AIPS
2000
14 years 11 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
LION
2009
Springer
112views Optimization» more  LION 2009»
15 years 4 months ago
A Graph-Based Semi-supervised Algorithm for Protein Function Prediction from Interaction Maps
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
Valerio Freschi
CVPR
2003
IEEE
15 years 3 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
AGTIVE
2007
Springer
15 years 1 months ago
Specifying Domain-Specific Refactorings for AndroMDA Based on Graph Transformation
Abstract. Applying refactoring in a model-driven software engineering context raises many new challenges that need to be addressed. In this paper, we consider model-driven software...
Gabriele Taentzer, Dirk Müller 0002, Tom Mens