We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
Abstract—Opportunistic wireless channel access by nonlicensed users has emerged as a promising solution for addressing the bandwidth scarcity challenge. Auctions represent a natu...
Abstract-- As intrusion detection essentially can be formulated as a binary classification problem, it thus can be solved by an effective classification technique-Support Vector Ma...
CT In this paper some experimental sequential models for the simulation of trip-chains are presented; the models have been calibrated on the base of a survey made in a medium-sized...
Demetrio C. Festa, Daniela Condino, Gabriella Mazz...
Practice has shown that providing content to students alone is not sufficient for good learning results. In computer based training (CBT) and especially webbased training (WBT) en...