Sciweavers

1650 search results - page 153 / 330
» The HOM problem is decidable
Sort
View
EACL
2006
ACL Anthology
15 years 5 months ago
Determining Term Subjectivity and Term Orientation for Opinion Mining
Opinion mining is a recent subdiscipline of computational linguistics which is concerned not with the topic a document is about, but with the opinion it expresses. To aid the extr...
Andrea Esuli, Fabrizio Sebastiani
ATAL
2010
Springer
15 years 5 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
COR
2007
86views more  COR 2007»
15 years 4 months ago
Sourcing with random yields and stochastic demand: A newsvendor approach
We studied a supplier selection problem, where a buyer, while facing random demand, is to decide ordering quantities from a set of suppliers with different yields and prices.We pr...
Shitao Yang, Jian Yang, Layek Abdel-Malek
CIKM
2009
Springer
15 years 11 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang
AUSAI
2007
Springer
15 years 10 months ago
The Detrimentality of Crossover
The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the nich...
Andrew Czarn, Cara MacNish, Kaipillil Vijayan, Ber...