This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima when run repeatedly. When greediness is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES...

In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomization and greediness on the performance of these multi-start heuristic search methods when solving this NP-hard problem. The former is a memory-le...

In this paper, we investigate a family of hill-climbing procedures related to GSAT, a greedy random hill-climbing procedure for satissability. These procedures are able to solve large and diicult satissability problems beyond the range of conventional procedures like Davis-Putnam. We explore the r^ ole of greediness, randomness and hill-climbing in the eeectiveness of these procedures. We show ...

In 2003, S. J. Dilworth, N. Kalton, D. Kutzarova and V. Temlyakov introduced the notion of almost greedy (respectively partially greedy) bases. These bases were characterized in terms quasi-greediness democracy conservativeness). this paper, we show a new functional characterization these type general Banach spaces following spirit greediness proved 2017 by P. M. Berná Ó. Blasco.

Shame is considered a social emotion with action tendencies that elicit socially beneficial behavior. Yet, unlike other social emotions, prior experimental studies do not indicate that incidental shame boosts prosocial behavior. Based on the affect as information theory, we hypothesize that incidental feelings of shame can increase cooperation, but only for self-interested individuals, and only...

In peer-to-peer networks, peers simultaneously play the role of client and server. Since the introduction of the first file-sharing protocols, peer-to-peer networking currently causes more than 35% of all internet network traffic— with an ever increasing tendency. A common file-sharing protocol that occupies most of the peer-to-peer traffic is the BitTorrent protocol. Although based on cooperat...

A key challenge in developing efficient local search solvers is to intelligently balance diversification and intensification. This study proposes a heuristic that integrates a new dynamic scoring function and two different diversification criteria: variable weights and stagnation weights. Our new dynamic scoring function is formulated to enhance the diversification capability in intensification...

We study the parameterized complexity of a broad class of problems called " local graph partitioning problems " that includes the classical fixed cardinality problems as max k-vertex cover, k-densest subgraph, etc. By developing a technique " greediness-for-parameterization " , we obtain fixed parameter algorithms with respect to a pair of parameters k, the size of the solution (but not its val...