We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...
Marie desJardins, Blazej Bulka, Ryan Carr, Andrew ...
We examine a setting in which a buyer wishes to purchase probabilistic information from some agent. The seller must invest effort in order to gain access to the information, and m...
Rescaling is possibly the most popular approach to cost-sensitive learning. This approach works by rescaling the classes according to their costs, and it can be realized in differ...
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
Monte Carlo Go is a promising method to improve the performance of computer Go programs. This approach determines the next move to play based on many Monte Carlo samples. This pap...
This paper is concerned with the problem of structured data extraction from Web pages. The objective of the research is to automatically segment data records in a page, extract da...