Sciweavers

1175 search results - page 60 / 235
» A scalable method for the generation of small test sets
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 1 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
GECCO
2009
Springer
163views Optimization» more  GECCO 2009»
14 years 2 months ago
Dealing with inheritance in OO evolutionary testing
Most of the software developed in the world follows the object-oriented (OO) paradigm. However, the existing work on evolutionary testing is mainly targeted to procedural language...
Javier Ferrer, J. Francisco Chicano, Enrique Alba
DAC
1996
ACM
14 years 1 days ago
Characterization and Parameterized Random Generation of Digital Circuits
The development of new Field-Programmed, MaskProgrammed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the arc...
Michael D. Hutton, Jerry P. Grossman, Jonathan Ros...
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 2 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
JASIS
2006
120views more  JASIS 2006»
13 years 7 months ago
Building a reusable test collection for question answering
In contrast to traditional information retrieval systems, which return ranked lists of documents that users must manually browse through, a question answering system attempts to d...
Jimmy J. Lin, Boris Katz