The single class best effort service available in the current Internet does not provide the guarantees, typically expressed in terms of minimum bandwidth and/or maximum delay or l...
A geometric approach is introduced to explain phenomena that can arise with Luce's choice axiom; e.g., differences occur when determining the likelihood of a ranking by start...
As the social interaction of Internet users increases, so does the need to effectively rank social media. We study the challenges of personalized ranking of blog posts. Web search...
Hassan Sayyadi, John Edmonds, Vagelis Hristidis, L...
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...