We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
A rational agent derives its choice of action from its beliefs and goals. Goals can be distinguished into achievement goals and maintenance goals. The aim of this paper is to defi...
Problems with large monolithical ontologies in terms of reusability, scalability and maintenance have lead to an increasing interest in modularization techniques for ontologies. Cu...
Mathieu d'Aquin, Anne Schlicht, Heiner Stuckenschm...
In this paper1 , we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate ...
Piraveenan Mahendra, Mikhail Prokopenko, Albert Y....