Sciweavers

2771 search results - page 207 / 555
» A General Computational Treatment of the Comparative
Sort
View
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 12 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
NDSS
1998
IEEE
15 years 10 months ago
Efficient Protocols for Signing Routing Messages
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
Kan Zhang
RECOMB
1998
Springer
15 years 10 months ago
A polyhedral approach to RNA sequence structure alignment
Ribonucleic acid (RNA) is a polymer composed of four bases denoted A, C, G, and U. It is a generally single-stranded molecule where the bases form hydrogen bonds within the same m...
Hans-Peter Lenhof, Knut Reinert, Martin Vingron
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 10 months ago
An efficient multi-objective evolutionary algorithm with steady-state replacement model
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
Dipti Srinivasan, Lily Rachmawati
ATAL
2010
Springer
15 years 7 months ago
Success, strategy and skill: an experimental study
In many AI settings an agent is comprised of both actionplanning and action-execution components. We examine the relationship between the precision of the execution component, the...
Christopher Archibald, Alon Altman, Yoav Shoham