Sciweavers

5606 search results - page 972 / 1122
» Randomization Techniques for Graphs.
Sort
View
SAC
2010
ACM
15 years 6 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
BMCBI
2010
178views more  BMCBI 2010»
15 years 6 months ago
An improved method for scoring protein-protein interactions using semantic similarity within the Gene Ontology
Background: Semantic similarity measures are useful to assess the physiological relevance of protein-protein interactions (PPIs). They quantify similarity between proteins based o...
Shobhit Jain, Gary D. Bader
ENTCS
2006
183views more  ENTCS 2006»
15 years 6 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...
JAIR
2006
179views more  JAIR 2006»
15 years 6 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
IJAC
2007
116views more  IJAC 2007»
15 years 6 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil