1232 search results - page 45 / 247 » Digraphs: theory, algorithms and applications |
188
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
146
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
171
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
180
Voted
EMSOFT
2011
Springer
14 years 5 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
166
click to vote
PDCN
2004
15 years 7 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...