Sciweavers

2526 search results - page 84 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
TASE
2007
IEEE
14 years 3 months ago
Evaluation of SAT-based Bounded Model Checking of ACTL Properties
Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD-based symbolic model checking of LTL and ACTL properties in recent years. For genera...
Yanyan Xu, Wei Chen, Liang Xu, Wenhui Zhang
EMO
2005
Springer
194views Optimization» more  EMO 2005»
14 years 2 months ago
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
Michael Emmerich, Nicola Beume, Boris Naujoks
LCPC
2005
Springer
14 years 2 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant ā...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
COLT
2005
Springer
14 years 2 months ago
A New Perspective on an Old Perceptron Algorithm
Abstract. We present a generalization of the Perceptron algorithm. The new algorithm performs a Perceptron-style update whenever the margin of an example is smaller than a predeļ¬...
Shai Shalev-Shwartz, Yoram Singer
TEC
2002
152views more  TEC 2002»
13 years 8 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck