101 search results - page 20 / 21 » sat 2009 |
FOCS
2009
IEEE
13 years 12 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
EMSOFT
2009
Springer
13 years 9 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
CONEXT
2009
ACM
13 years 6 months ago
2009
ACM
We investigate the feasibility of content distribution between devices mounted in moving vehicles using commodity WiFi. We assume that each device stores content in a set of files...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
ICCAD
2009
IEEE
13 years 3 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...