Sciweavers

3341 search results - page 229 / 669
» On Bounded Queries and Approximation
Sort
View
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
15 years 6 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas
DATE
2004
IEEE
128views Hardware» more  DATE 2004»
15 years 10 months ago
Enhanced Diameter Bounding via Structural
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...
Jason Baumgartner, Andreas Kuehlmann
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
JUCS
2010
109views more  JUCS 2010»
15 years 1 months ago
Semantics of Query-Driven Communication of Exact Values
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
Michal Konecný, Amin Farjudian
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 24 days ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...