11328 search results - page 40 / 2266 » Timed Branching Processes |
126
click to vote
FSEN
2009
Springer
15 years 8 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
219
click to vote
ASPLOS
2009
ACM
16 years 2 months ago
2009
ACM
Modern processors use branch target buffers (BTBs) to predict the target address of branches such that they can fetch ahead in the instruction stream increasing concurrency and pe...
113
click to vote
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
JSS
2010
15 years 11 days ago
2010
Automated test data generation has remained a topic of considerable interest for several decades because it lies at the heart of attempts to automate the process of Software Testi...
136
click to vote
MICRO
1995
IEEE
15 years 5 months ago
1995
IEEE
Instruction Level Parallelism (ILP) speedups of an order-of-magnitude or greater may be possible using the techniques described herein. Traditional speculative code execution is t...