2766 search results - page 151 / 554 » Algorithms for trigonometric polynomials |
117
click to vote
CSL
2002
Springer
15 years 4 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
135
click to vote
IPL
2002
15 years 3 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
143
click to vote
PTS
2010
15 years 2 months ago
2010
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
144
click to vote
COLOGNETWENTE
2010
15 years 2 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
168
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...