5165 search results - page 307 / 1033 » Consistency of the Neighbor-Net Algorithm |
174
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
168
click to vote
FPGA
2001
ACM
15 years 11 months ago
2001
ACM
Conventional technology mapping algorithms for SRAM-based Field Programmable Gate Arrays (FPGAs) are normally carried out on a fixed logic decomposition of a circuit. The impact o...
176
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
216
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
175
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...