A Generic Scheme for Combining Multiple Inclusion Representations in Numerical Constraint Propagation
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear combination of basis functions with coefficients as decision variables. By rela ...
This paper reports refinement studies on the temporal coupling scheme and time-stepping management of TRACE/S3K, a dynamically coupled code version of the thermal-hydraulics system code TRACE and the 3D core simulator Simulate-3K. The studies were carried ...
Real-time optimization (RTO) is a class of methods that use measurements to reject the effect of uncertainty on optimal performance. This article compares six implicit RTO schemes, that is, schemes that implement optimality not through numerical optimizati ...
The subject of real-time, steady-state optimization under significant uncertainty is addressed in this paper. Specifically, the use of constraint-adaptation schemes is reviewed, and it is shown that, in general, such schemes cannot guarantee process feasib ...
A multi-stage secret sharing (MSS) scheme is a method of sharing a number of secrets among a set of participants, such that any authorized subset of participants could recover one secret in every stage. The first MSS scheme was proposed by He and Dawson in ...
Building tight and conservative enclosures of the solution set is of crucial importance in the design of efficient complete solvers for numerical constraint satisfaction problems (NCSPs). This paper proposes a novel generic algorithm enabling the cooperati ...
The fundamentals of interval analysis on directed acyclic graphs (DAGs) for global optimization and constraint propagation have recently been proposed in Schichl and Neumaier (J. Global Optim. 33, 541-562, 2005). For representing numerical problems, the au ...
We will develop and implement new algorithms for constraint solving and apply them to construct two classes of tools: 1) bug finding and verification tools building on tools such as Java PathFinder and Jahob; 2) tools for deep semantic analysis of texts co ...
Recently, it was shown that it is possible to develop exact sampling schemes for a large class of parametric nonban- dlimited signals, namely certain signals of finite rate of innovation. A common feature of such signals is that they have a finite number o ...
A constraint satisfaction problem (e.g., a system of equations and inequalities) consists of a finite set of constraints specifying which value combinations from given variable domains are admitted. It is called numerical if its variable domains are contin ...
