Sciweavers

2027 search results - page 327 / 406
» When is it best to best-respond
Sort
View
ICSE
2008
IEEE-ACM
16 years 1 months ago
ARTOO: adaptive random testing for object-oriented software
Intuition is often not a good guide to know which testing strategies will work best. There is no substitute for experimental analysis based on objective criteria: how many bugs a ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
120
Voted
WWW
2003
ACM
16 years 1 months ago
Mining the peanut gallery: opinion extraction and semantic classification of product reviews
The web contains a wealth of product reviews, but sifting through them is a daunting task. Ideally, an opinion mining tool would process a set of search results for a given item, ...
Kushal Dave, Steve Lawrence, David M. Pennock
100
Voted
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 1 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
103
Voted
RECOMB
2009
Springer
16 years 1 months ago
How Many Bootstrap Replicates Are Necessary?
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
Nicholas D. Pattengale, Masoud Alipour, Olaf R. P....
SPAA
2009
ACM
16 years 1 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman