Abstract: We propose an algorithm based on infeasible irreducible subsystems (IIS) to solve general binary chance-constrained problems. By leveraging on the problem structure we are able to generate good quality upper bounds to the optimal value early in the algorithm, and the discrete domain is used to guide us efficiently in the search of solutions….
Abstract: Hoy tenemos acceso a una gran cantidad de datos, provenientes de diferentes fuentes y que presentan diferentes características. Por ejemplo, contamos con múltiples representaciones geográficas: mapas, imágenes satélite, bases de datos vectoriales, entre otras. Los usuarios de sistemas de información geográficos necesitan combinar y comparar estas representaciones heterogéneas de una misma región. Por ejemplo,…
Abstract: Self-determination (SD) disputes are some of the most common conflicts in the world. Around a third of the civil wars in the last decades relate to demands for increased autonomy or independence (Sambanis and Milanovic, 2014). While the literature has mainly focused on the most violent conflicts, such as civil wars, recent studies have…
Abstract: Coq is a very popular proof assistant, used in a variety of academic and industrial projects, for formalizing both computer science results as well as mathematical ones. Coq is based on a theoretically very clean model, the Calculus of Inductive Constructions, which allows to express all of mathematics in a constructive manner. Following the…
Abstract: With a new generation of large etendue (the product of field of view and mirror area) survey telescopes there is a growing need for astronomical alert processing systems. Astronomical alerts correspond to detected changes in the sky with an astrophysical origin. Astronomical alert processing systems involve the real–time processing of data for alert generation,…
Abstract: Many practical problems can be reduced recursively to smaller or simpler instances, down to the base cases. Most often, a straightforward implementation of such reduction fails to yield a solution running in reasonable time. In many cases it is Dynamic Programming which yields solutions of industrial value, based on an adequate tuning of the…
Abstract: An instance of the constraint satisfaction problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain to the variables so that all constraints are satisfied. In the optimization version, the goal is to maximize the number of satisfied constraints…
Abstract: The Propaganda Model (PM) discussed in Manufacturing Consent is a theory in political economy that states that the mass media are channels through which governments and major power groups pass down certain ideologies and mold a general consent according to their own interests. According to the authors, every piece of news has gone through…