Search results for "greed"
showing 10 items of 57 documents
Iterated greedy with variable neighborhood search for a multiobjective waste collection problem
2020
Abstract In the last few years, the application of decision making to logistic problems has become crucial for public and private organizations. Efficient decisions clearly contribute to improve operational aspects such as cost reduction or service improvement. The particular case of waste collection service considered in this paper involves a set of economic, labor and environmental issues that translate into difficult operational problems. They pose a challenge to nowadays optimization technologies since they have multiple constraints and multiple objectives that may be in conflict. We therefore need to resort to multiobjective approaches to model and solve this problem, providing efficie…
Modeling Energy Demand Aggregators for Residential Consumers
2013
International audience; Energy demand aggregators are new actors in the energy scenario: they gather a group of energy consumers and implement a demand- response paradigm. When the energy provider needs to reduce the current energy demand on the grid, it can pay the energy demand aggregator to reduce the load by turning off some of its consumers loads or postponing their activation. Currently this operation involves only greedy energy consumers like industrial plants. In this paper we want to study the potential of aggregating a large number of small energy consumers like home users as it may happen in smart grids. In particular we want to address the feasibility of such approach by conside…
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
Determinación de la edad de un extranjero indocumentado : A propósito de la sentencia de la audiencia provincial de barcelona, de 24 de enero de 2020
2021
In recent years, immigration of minors has increased, which means that administrations establish a differentiated treatment for this sector of immigration due to the fact that they are minors; There are many aspects to take into account in these cases, including verifying the minority age, a fact that is more complicated when it comes to adolescents. This is what is analyzed by the Judgment of the Provincial Court of Barcelona, of January 24, 2020, which confirms the Resolution of the General Directorate of Attention to Children and Adolescents, which agreed to the closure of the homelessness file and the admission of the plaintiff in a Protection Center until the verification of their pers…
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
2009
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function operating a trade-off between accuracy and complexity in the final model. We address the problem of reducing the complexity by fixing a certain degree of sparsity, and trying to find the solution that “better” satisfi…
PINCoC: a Co-Clustering based Method to Analyze Protein-Protein Interaction Networks
2007
Anovel technique to search for functionalmodules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the undirected graph modelling it. The algorithm introduces the concept of quality of a sub-matrix of the adjacency matrix, and applies a greedy search technique for finding local optimal solutions made of dense submatrices containing the maximum number of ones. An initial random solution, constituted by a single protein, is evolved to search for a locally optimal solution by adding/removing connected proteins that best contribute to improve the quality function. Experimental evaluations carried out on Saccaromyces Cerevis…
Deconvolution by Regularized Matching Pursuit
2014
In this chapter, an efficient method that restores signals from strongly noised blurred discrete data is presented. The method can be characterized as a Regularized Matching Pursuit (RMP), where dictionaries consist of spline wavelet packets. It combines ideas from spline theory, wavelet analysis and greedy algorithms. The main distinction from the conventional matching pursuit is that different dictionaries are used to test the data and to approximate the solution. In addition, oblique projections of data onto dictionary elements are used instead of orthogonal projections, which are used in the conventional Matching Pursuit (MP). The slopes of the projections and the stopping rule for the …
Algunas reflexiones acerca de la stjue de 9 de julio de 2020 sobre los pactos novatorios en materia de cláusulas suelo
2021
The Sentence of the Court of Justice of the European Union of July 9, 2020 comes to answer the five questions that, in its preliminary question, the Court of First Instance and Instruction No. 3 of Teruel asks about the validity of the new agreements in the context of the floor clauses, establishing jurisprudential doctrine on this matter about which our Supreme Court had previously ruled in its Judgments of October 16, 2017, in the sense of considering the agreed floor clause null as a consequence of the novation agreement and, subsequently, those of April 11, 2018 and September 13, 2018 in the opposite direction, declaring that the novation agreement was valid. It is a long-awaited and in…
Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs
2009
AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.
A Greedy Algorithm for Hierarchical Complete Linkage Clustering
2014
We are interested in the greedy method to compute an hierarchical complete linkage clustering. There are two known methods for this problem, one having a running time of \({\mathcal O}(n^3)\) with a space requirement of \({\mathcal O}(n)\) and one having a running time of \({\mathcal O}(n^2 \log n)\) with a space requirement of Θ(n 2), where n is the number of points to be clustered. Both methods are not capable to handle large point sets. In this paper, we give an algorithm with a space requirement of \({\mathcal O}(n)\) which is able to cluster one million points in a day on current commodity hardware.