Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
—This paper considers the tradeoff between bursty and continuous transmissions in wireless ad hoc networks. In our network model, packets belonging to specific transmitters arri...
Jon E. Corneliussen, Mariam Kaynia, Geir E. &Oslas...
Future embedded and wireless devices will be increasingly powerful supporting many applications including one of the most crucial, security. Although many wireless and embedded de...
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...