A group of web caches can be organized into a cooperative hierarchy where a search for a requested object is performed among the cooperating peer caches before the object request ...
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altma...
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...