36781 search results - page 291 / 7357 » Parameterizing by the Number of Numbers |
139
click to vote
IM
2007
15 years 6 months ago
2007
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
182
click to vote
INFORMS
2010
15 years 4 months ago
2010
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should ...
154
click to vote
CDC
2010
IEEE
2010
IEEE
Robust controller design by convex optimization based on finite frequency samples of spectral models
15 years 1 months ago
Abstract-- Some frequency-domain controller design problems are solved using a finite number of frequency samples. Consequently, the performance and stability conditions are not gu...
204
click to vote
ISPAN
2002
IEEE
15 years 11 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
162
click to vote
FSTTCS
2009
Springer
16 years 20 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...