2693 search results - page 53 / 539 » On Computing Complex Navigation Functions |
148
click to vote
ERSHOV
2003
Springer
15 years 11 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
133
click to vote
JC
2000
15 years 5 months ago
2000
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
163
click to vote
RTA
2009
Springer
16 years 16 days ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
164
click to vote
HPDC
2010
IEEE
15 years 7 months ago
2010
IEEE
A common task in biological research is to predict function for proteins by comparing sequences between proteins of known and unknown function. This is often done using pair-wise ...
161
click to vote
DLT
2009
15 years 3 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...