Sciweavers

999 search results - page 3 / 200
» On the Decidability of Functional Uncertainty
Sort
View
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 25 days ago
Adaptive Sampling for Noisy Problems
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...
Erick Cantú-Paz
VMCAI
2009
Springer
14 years 2 months ago
Deciding Extensions of the Theories of Vectors and Bags
Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established ...
Patrick Maier
KR
2010
Springer
14 years 7 days ago
A Decidable Class of Groundable Formulas in the General Theory of Stable Models
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
Michael Bartholomew, Joohyung Lee
CODES
2007
IEEE
14 years 1 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling
ENGL
2007
75views more  ENGL 2007»
13 years 7 months ago
Uncertainty Modeling for Expensive Functions: A Rank Transformation Approach
An uncertainty model for an expensive function greatly improves the effectiveness of a design decision based on the use of a less accurate function. In this paper, we propose a met...
J. Umakant, K. Sudhakar, P. M. Mujumdar, C. Raghav...