4565 search results - page 521 / 913 » Time Optimal Self-Stabilizing Algorithms |
127
click to vote
SAS
1997
Springer
15 years 7 months ago
1997
Springer
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
134
click to vote
COLT
2008
Springer
15 years 5 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
122
click to vote
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
133
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
—We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence futu...
124
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling can achieve. Therefore, the combination of clock skew scheduling and dela...