2695 search results - page 59 / 539 » The Complexity of Forecast Testing |
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
The synthesis of stochastic processes using genetic programming is investigated. Stochastic process behaviours take the form of time series data, in which quantities of interest v...
122
click to vote
VLSID
2010
IEEE
14 years 7 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
TAICPART
2006
IEEE
15 years 3 months ago
2006
IEEE
Testing compositions of web services is complex, due to their distributed nature and asynchronous behaviour. However, research in this field is scarce. We propose a new testing me...