9176 search results - page 433 / 1836 » algorithms 2010 |
160
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
185
click to vote
JDA
2010
15 years 5 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
182
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...
181
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
183
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...