Sciweavers

2150 search results - page 54 / 430
» On a restricted cross-intersection problem
Sort
View
GECCO
2004
Springer
15 years 3 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...
STRINGOLOGY
2004
14 years 11 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
TIS
1998
59views more  TIS 1998»
14 years 9 months ago
Information Access in Africa: Problems with Every Channel
: Every information channel within Africa is restricted. Limited budgets cause televison stations to produce few shows of their own and to fill airtime with cheap American imports ...
William Wresch
CSL
2009
Springer
15 years 4 months ago
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
Jacques Duparc, Alessandro Facchini, Filip Murlak
IEEEPACT
1998
IEEE
15 years 2 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...