2266 search results - page 275 / 454 » Some Solutions to the Ignoring Problem |
179
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
153
click to vote
BTW
2009
Springer
15 years 10 months ago
2009
Springer
: Simplifying data programming is a core mission of data management research. The issue at stake is to help engineers build efficient and robust data-centric applications. The fron...
183
click to vote
FLAIRS
2007
15 years 9 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
172
click to vote
ASM
2008
ASM
15 years 8 months ago
2008
ASM
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
155
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...