We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
In this paper we present a methodology for extracting subcategorisation frames based on an automatic LFG f-structure annotation algorithm Penn-II Treebank. We extract abstract syn...
Ruth O'Donovan, Michael Burke, Aoife Cahill, Josef...
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
Robert P. Goldman, Michael J. S. Pelican, David J....
In this paper, we proposed dynamic co-allocation schemes for parallel data transfer in a grid environment, which copes up with highly inconsistent network performances of the serv...
Raghuvel S. Bhuvaneswaran, Yoshiaki Katayama, Naoh...