14774 search results - page 488 / 2955 » Computational complexity and evolutionary computation |
142
click to vote
MFCS
1993
Springer
15 years 11 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
256
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract: Modeling systems with Statecharts has become standard practice in the design of reactive embedded devices. However, the modeling of realistic applications with the paradi...
144
click to vote
JC
2006
15 years 6 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
194
click to vote
AUTOMATICA
1999
15 years 6 months ago
1999
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...
172
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...