Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
Abstract--This paper presents a new nonlinear adaptive tracking controller for a class of general time-variant nonlinear systems. The control system consists of an inner loop and a...
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...