Sciweavers

3946 search results - page 393 / 790
» The computational complexity of choice sets
Sort
View
ENTCS
2008
137views more  ENTCS 2008»
15 years 7 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells
BMCBI
2006
133views more  BMCBI 2006»
15 years 7 months ago
Choosing negative examples for the prediction of protein-protein interactions
The protein-protein interaction networks of even well-studied model organisms are sketchy at best, highlighting the continued need for computational methods to help direct experim...
Asa Ben-Hur, William Stafford Noble
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
15 years 7 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
WIOPT
2010
IEEE
15 years 5 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi
JSA
2010
173views more  JSA 2010»
15 years 2 months ago
Hardware/software support for adaptive work-stealing in on-chip multiprocessor
During the past few years, embedded digital systems have been requested to provide a huge amount of processing power and functionality. A very likely foreseeable step to pursue th...
Quentin L. Meunier, Frédéric P&eacut...