Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Abstract. Despite the great amount of knowledge produced by the neuroscientific literature affective phenomena, current models tackling noncognitive aspects of behavior are often b...
Marco Mirolli, Francesco Mannella, Gianluca Baldas...
Abstract-- Network management and operations are complicated, tedious, and error-prone, requiring significant human involvement and domain knowledge. As the complexity involved ine...
Xu Chen, Yun Mao, Zhuoqing Morley Mao, Jacobus E. ...
In this paper, we explore a simple yet effective technique for explicitly allocating airtime to each active pair of communicating neighbors in a wireless neighborhood so that TCP ...
Over the last decade, IPv6 has established itself as the most mature network protocol for the future Internet. Its recent deployment in core networks of operators, its availability...
The increasing popularity in the late 1970s of affordable, general-purpose, microprocessor-based personal computers in the US, generated a widespread interest around the world in t...