3875 search results - page 472 / 775 » Approximation algorithms for the 0-extension problem |
154
click to vote
ATAL
2003
Springer
15 years 12 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
171
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
170
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
144
click to vote
NIPS
2008
15 years 8 months ago
2008
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
169
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...