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.
NOVELTY - The method involves traversing a tree of potential complex computer operations; and pruning the tree for optimality under constraints. The optimality comprises maximization of a function of merit. The constraints comprise a convexity constraint, a maximum-input-multiplicity constraint, or a maximum-output-multiplicity constraint. USE - For determining complex computer operation for computer application. ADVANTAGE - Enhances processing performance by automatically forming extensions from high-level application code. DETAILED DESCRIPTION - An INDEPENDENT CLAIM is also included for a system for determining a complex computer operation for a computer application.
Basil Duval, Jonathan Bryan Lister, Jean-Marc Moret, Philippe Marmillod, Xavier Llobet, Blaise Marlétaz, Pierre-François Isoz