The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding succes...
Abstract--Recently Kutin and Niyogi investigated several notions of algorithmic stability--a property of a learning map conceptually similar to continuity--showing that training-st...
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
Abstract. We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractua...
Abstract. Commutative Replicated Data-Type (CRDT) is a new class of algorithms that ensures scalable consistency of replicated data. It has been successfully applied to collaborati...