An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form o...
Jessica Davies, George Katsirelos, Nina Narodytska...
We analyze over 500 million Twitter messages from an eight month period and find that tracking a small number of flu-related keywords allows us to forecast future influenza rates ...
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
In this paper we tried to focus on some of the problems with the mobile keypad and text entering in these devices, and tried to give some possible suggestions. We mainly took some...
Satish Narayana Srirama, M. A. A. Faruque, M. A. S...
: Problem statement: Vehicular Ad hoc Networks (VANET) is one of the most challenging research area in the field of Mobile Ad Hoc Networks. Approach: In this research we proposed a...
Ghassan Samara, Sureswaran Ramadas, Wafaa A. H. Al...
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...