Sciweavers

2218 search results - page 265 / 444
» Testing Expressibility Is Hard
Sort
View
CAINE
2003
15 years 2 months ago
A Genetic Algorithm for Clustering on Very Large Data Sets
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
Jim Gasvoda, Qin Ding
88
Voted
IJCAI
2001
15 years 2 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
92
Voted
AAAI
2000
15 years 2 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
76
Voted
COLING
2000
15 years 2 months ago
Data-Oriented Translation
Data-Oriented Translation (DOT), which is based on Data-Oriented Parsing (DOP), comprises an experience-based approach to translation, where new translations are derived with refe...
Arjen Poutsma
89
Voted
AAAI
1994
15 years 2 months ago
An Instructional Environment for Practicing Argumentation Skills
CAT0 is an instructions environment for practicing basic skills of legal research: to use cases in arguments about a problem situation and to test a theory about a legal domain. U...
Vincent Aleven, Kevin D. Ashley