: Web service search is an important problem in service oriented architecture that has attracted widespread attention from academia as well as industry. Web service searching can b...
Though in most data warehousing applications no relevance is given to the time when events are recorded, some domains call for a different behavior. In particular, whenever late re...
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
— We present the memetic climber, a simple search algorithm that learns topology and weights of neural networks on different time scales. When applied to the problem of learning ...