Sciweavers

201 search results - page 40 / 41
» The Minimum Substring Cover Problem
Sort
View
ASPLOS
2006
ACM
14 years 1 months ago
Introspective 3D chips
While the number of transistors on a chip increases exponentially over time, the productivity that can be realized from these systems has not kept pace. To deal with the complexit...
Shashidhar Mysore, Banit Agrawal, Navin Srivastava...
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
14 years 18 days ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
ATVA
2006
Springer
102views Hardware» more  ATVA 2006»
13 years 11 months ago
A Semantic Framework for Test Coverage
Abstract. Since testing is inherently incomplete, test selection is of vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test case...
Laura Brandán Briones, Ed Brinksma, Mari&eu...
PPSN
2010
Springer
13 years 5 months ago
Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective Search
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...
Tamara Ulrich, Johannes Bader, Lothar Thiele
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel