Sciweavers

9997 search results - page 298 / 2000
» The case for crowd computing
Sort
View
SIAMSC
2011
177views more  SIAMSC 2011»
15 years 1 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
WINE
2009
Springer
178views Economy» more  WINE 2009»
16 years 1 months ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
16 years 1 days ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
IJAR
2006
125views more  IJAR 2006»
15 years 6 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
BMCBI
2005
169views more  BMCBI 2005»
15 years 6 months ago
MAPPER: a search engine for the computational identification of putative transcription factor binding sites in multiple genomes
Background: Cis-regulatory modules are combinations of regulatory elements occurring in close proximity to each other that control the spatial and temporal expression of genes. Th...
Voichita D. Marinescu, Isaac S. Kohane, Alberto Ri...