3415 search results - page 507 / 683 » Lower bounds on kernelization |
176
click to vote
DAM
2007
15 years 6 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
158
Voted
JPDC
2007
15 years 6 months ago
2007
Mesh networks are among the most important interconnection network topologies for large multicomputer systems. Mesh networks perform poorly in tolerating faults in the view of wor...
181
click to vote
TSP
2008
15 years 6 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
181
click to vote
RTS
2008
15 years 5 months ago
2008
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
145
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...