4491 search results - page 396 / 899 » Algorithm Engineering |
129
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
146
click to vote
FASE
2006
Springer
15 years 8 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
153
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
135
click to vote
ALENEX
2009
15 years 2 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
143
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...