Sciweavers

1241 search results - page 148 / 249
» Path-oriented random testing
Sort
View
109
Voted
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 7 months ago
Efficient octilinear Steiner tree construction based on spanning graphs
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Y...
GECCO
2004
Springer
15 years 7 months ago
Distributed Constraint Satisfaction, Restricted Recombination, and Hybrid Genetic Search
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
Gerry V. Dozier, Hurley Cunningham, Winard Britt, ...
78
Voted
CLEF
2003
Springer
15 years 7 months ago
Comparing Weighting Models for Monolingual Information Retrieval
Motivated by the hypothesis that the retrieval performance of a weighting model is independent of the language in which queries and collection are expressed, we compared the retrie...
Gianni Amati, Claudio Carpineto, Giovanni Romano
CSCLP
2003
Springer
15 years 7 months ago
Experimental Evaluation of Interchangeability in Soft CSPs
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
ICCBR
2003
Springer
15 years 7 months ago
Soft Interchangeability for Case Adaptation
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
Nicoleta Neagu, Boi Faltings