533 search results - page 102 / 107 » The Computational Complexity of Sensitivity Analysis and Par... |
SIGCOMM
2009
ACM
14 years 2 months ago
2009
ACM
We define some interesting incentive issues that arise in the management of virtual infrastructures. We demonstrate that participants’ decisions about the quantities of infrast...
CG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
BMCBI
2005
13 years 7 months ago
2005
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
CODES
2006
IEEE
14 years 1 months ago
2006
IEEE
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...