The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
Oliver C. Schrempf, David Albrecht, Uwe D. Hanebec...
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy ...
This tool paper describes a modular program slicer for Java built using the Indus program analysis framework along with it’s Eclipse-based user interface called Kaveri. Indus pro...