The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
: Resonance (Gibson, 1986) of users while interacting with a product should be a key issue in the development of human computer interaction. Because resonance requires developing o...
“History Teaches Everything, Including the Future”, wrote Alphonse de Lamartine in the nineteen century. Even if history cannot be really considered a predictive science, hist...
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...