Sciweavers

738 search results - page 106 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
AI
2003
Springer
15 years 3 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
CVPR
1997
IEEE
15 years 1 months ago
Deformable Multi Template Matching with Application to Portal Images
The exact positioning of patients during radiotherapy is essential for high precision treatment. The registration of portal image sequences can help to control the patient positio...
Martin Berger, Gaudenz Danuser
DAC
2004
ACM
15 years 10 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
ICDCS
2010
IEEE
15 years 1 months ago
A New Buffer Cache Design Exploiting Both Temporal and Content Localities
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
Jin Ren, Qing Yang
ADHOCNOW
2008
Springer
15 years 4 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...