Sciweavers

1434 search results - page 98 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
AUTOMATICA
2011
13 years 1 months ago
Fast computation of minimal elementary decompositions of metabolic flux vectors
The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector ca...
Raphaël M. Jungers, Francisca Zamorano, Vince...
FOCS
1990
IEEE
14 years 2 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
INFOCOM
2008
IEEE
14 years 4 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
PRDC
2002
IEEE
14 years 3 months ago
Caveat Emptor: Making Grid Services Dependable from the Client Side
Grid computing relies on fragile partnerships. Clients with hundreds or even thousands of pending service requests must seek out and form temporary alliances with remote servers e...
Miron Livny, Douglas Thain
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 3 months 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...