3934 search results - page 185 / 787 » Approximate Schedulability Analysis |
172
click to vote
CAV
2005
Springer
16 years 3 hour ago
2005
Springer
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
285
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
169
click to vote
GECCO
2004
Springer
15 years 12 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...
156
click to vote
AIPS
2008
15 years 8 months ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
159
click to vote
FMSB
2008
15 years 8 months ago
2008
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...