Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
—In this paper, we study the problem of evolutionary clustering of multi-typed objects in a heterogeneous bibliographic network. The traditional methods of homogeneous clustering...
Manish Gupta, Charu C. Aggarwal, Jiawei Han, Yizho...
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...