Expressiveness And Closure Properties For Quantitative Languages

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Using data on international equity portfolio allocations by U.S. mutual funds, we estimate a portfolio expression derived from a standard mean-variance portfolio model extended with portfolio frictions. The optimal portfolio depends on the previous month a ...

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ̅L ...

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite ...

We study the Lonely Runner Conjecture, conceived by Jörg M. Wills in the 1960's: Given positive integers n_1, n_2, ... , n_k, there exists a positive real number t such that for all 1 \le j \le k the distance of t n_j to the nearest integer is at least 1 / ...

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

We consider the problem of finding the optimal time to switch between two measurable cash-flow streams. A complete characterization of the set of solutions is obtained in terms of adjoint variables which measure the available gain from deviations. An itera ...

We study the extinction time tau of the contact process started with full occupancy on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on Z, then, uniformly over all trees of degr ...

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Consider a finite set of sources, each producing independent identically distributed observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources ...

The well-known "necklace splitting theorem" of Alon (1987) asserts that every k-colored necklace can be fairly split into q parts using at most t cuts, provided k(q - 1)

The work described is part of a long term program of introducing institutional robotics, a novel framework for the coordination of robot teams that stems from institutional economics concepts. Under the framework, institutions are cumulative sets of persis ...

The special linear group G = SLn(Z[x(1), ... , x(k)]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, and p be any real number in (1, infinity). The main result is the following: any finite index subgroup of G has the fixe ...

The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime power conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p(r), where p is an odd prime number ...

Arterial tree hemodynamics can be simulated by means of several models of different level of complexity, depending on the outputs of interest and the desired degree of accuracy. In this work, several numerical comparisons of geometrical multiscale models a ...

We prove upper bounds for Hecke-Laplace eigenfunctions on certain Riemannian manifolds X of arithmetic type, uniformly in the eigenvalue and the volume of the manifold. The manifolds under consideration are d-fold products of 2-spheres or 3-spheres, realiz ...

We develop a model of investment, financing, and cash management decisions in which investment is lumpy and firms face uncertainty regarding their ability to raise funds in the capital markets. We characterize optimal policies explicitly and show that the ...

Reo is a coordination language that can be used to model different systems. We propose a technique for symbolic execution of Reo circuits using the symbolic representation of data constraints in Constraint Automata. This technique enables us to obtain the ...

We present Counterexample-Guided Accelerated Abstraction Refinement (CEGAAR), a new algorithm for verifying infinite-state transition systems. CEGAAR combines interpolation-based predicate discovery in counterexample guided predicate abstraction with accel ...

Expressiveness And Closure Properties For Quantitative Languages

Chattez avec Graph Search

International Portfolio Choice with Frictions: Evidence from Mutual Funds

Lower Bounds for Unambiguous Automata via Communication Complexity

Fourier non-uniqueness sets from totally real number fields

Lonely Runner Polyhedra

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Optimal Switching Between Cash-Flow Streams

Exponential extinction time of the contact process on finite graphs

Measuring and Synthesizing Systems in Probabilistic Environments

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences

Obstacles For Splitting Multidimensional Necklaces

Formalization, Implementation, and Modeling of Institutional Controllers for Distributed Robotic Systems

Fixed Point Property For Universal Lattice On Schatten Classes

Upper bounds for the Euclidean minima of abelian fields of odd prime power conductor

Numerical comparison and calibration of geometrical multiscale models for the simulation of arterial flows

Hybrid Bounds For Automorphic Forms On Ellipsoids Over Number Fields

Capital Supply Uncertainty, Cash Holdings, and Investment

Symbolic execution of Reo circuits using constraint automata

Accelerating Interpolants