Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
This paper describes an ontology-based service discovery front-end interface for GloServ. GloServ is a service discovery engine, which is an ontologybased distributed service disco...
Knarig Arabshian, Christian Dickmann, Henning Schu...
“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...
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
The advent and popularity of the World Wide Web (WWW) has enabled access to a variety of semi-structured data and, when available, this data follows some common XML schema. On the...