Sciweavers

9572 search results - page 8 / 1915
» Cover Algorithms and Their Combination
Sort
View
CEC
2007
IEEE
14 years 1 months ago
On improving approximate solutions by evolutionary algorithms
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank ...
FOCS
2009
IEEE
14 years 2 months ago
Decomposing Coverings and the Planar Sensor Cover Problem
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
Matt Gibson, Kasturi R. Varadarajan
CF
2008
ACM
13 years 9 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
PAMI
2008
250views more  PAMI 2008»
13 years 7 months ago
Combined Top-Down/Bottom-Up Segmentation
We construct an image segmentation scheme that combines top-down (TD) with bottom-up (BU) processing. In the proposed scheme, segmentation and recognition are intertwined rather th...
Eran Borenstein, Shimon Ullman
EDCC
2005
Springer
14 years 1 months ago
PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...
Nicky Williams, Bruno Marre, Patricia Mouy, Muriel...