A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
A new formalism and approach to describing cellular and molecular processes and structures is introduced, designed to support the creation of knowledge bases of molecular and cell...
Recent increases in the density and size of memory ICs made it ne cessary to search for new defect tolerance techniques since the traditional methods are no longer e ective enough...
Keyword search is recognized as an important technique to unlocking the information found in both structured and semistructured information. With XML as the data model and XQuery ...
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...