Sciweavers

120 search results - page 24 / 24
» Searching for close alternative plans
Sort
View
CSMR
2010
IEEE
13 years 5 months ago
Does the Past Say It All? Using History to Predict Change Sets in a CMDB
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
Sarah Nadi, Richard C. Holt, Serge Mankovski
CADE
2004
Springer
14 years 11 months ago
The ICS Decision Procedures for Embedded Deduction
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
Leonardo Mendonça de Moura, Sam Owre, Haral...
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 4 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
14 years 16 days ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
BMCBI
2010
151views more  BMCBI 2010»
13 years 11 months ago
Using diffusion distances for flexible molecular shape comparison
Background: Many molecules are flexible and undergo significant shape deformation as part of their function, and yet most existing molecular shape comparison (MSC) methods treat t...
Yu-Shen Liu, Qi Li, Guo-Qin Zheng, Karthik Ramani,...