11328 search results - page 25 / 2266 » Timed Branching Processes |
110
Voted
MICRO
2003
IEEE
15 years 7 months ago
2003
IEEE
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...
90
Voted
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
106
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
115
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
This work presents a performance analysis of a Multi-Branches Genetic Programming (MBGP) approach applied in symbolic regression (e.g. function approximation) problems. Genetic Pro...
131
click to vote
ATVA
2004
Springer
15 years 7 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...