Sciweavers

977 search results - page 88 / 196
» Permuting Web Graphs
Sort
View
SAT
2007
Springer
181views Hardware» more  SAT 2007»
15 years 6 months ago
Breaking Symmetries in SAT Matrix Models
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
Inês Lynce, João P. Marques Silva
DNA
2005
Springer
117views Bioinformatics» more  DNA 2005»
15 years 5 months ago
Simple Operations for Gene Assembly
Abstract. The intramolecular model for gene assembly in ciliates considers three operations, ld, hi, and dlad that can assemble any gene pattern through folding and recombination: ...
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz ...
EUROCRYPT
2005
Springer
15 years 5 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 3 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
DAM
2008
75views more  DAM 2008»
14 years 12 months ago
Patterns of simple gene assembly in ciliates
The intramolecular model for gene assembly in ciliates considers three operations, ld, hi, and dlad that can assemble any gene pattern through folding and recombination: the molec...
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz ...