Sciweavers

218 search results - page 25 / 44
» Case Study of Feature Location Using Dependence Graph
Sort
View
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 5 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
ECCV
2000
Springer
16 years 1 months ago
Significantly Different Textures: A Computational Model of Pre-attentive Texture Segmentation
Abstract. Recent human vision research [1] suggests modelling preattentive texture segmentation by taking a set of feature samples from a local region on each side of a hypothesize...
Ruth Rosenholz
ICSE
2008
IEEE-ACM
16 years 17 days ago
Are fit tables really talking?: a series of experiments to understand whether fit tables are useful during evolution tasks
Test-driven software development tackles the problem of operationally defining the features to be implemented by means of test cases. This approach was recently ported to the earl...
Filippo Ricca, Massimiliano Di Penta, Marco Torchi...
IWPC
2006
IEEE
15 years 5 months ago
A Metric-Based Heuristic Framework to Detect Object-Oriented Design Flaws
One of the important activities in re-engineering process is detecting design flaws. Such design flaws prevent an efficient maintenance, and further development of a system. Th...
Mazeiar Salehie, Shimin Li, Ladan Tahvildari
UAI
1996
15 years 1 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter