4843 search results - page 235 / 969 » The Shortcut Problem - Complexity and Approximation |
108
click to vote
AIPS
2007
15 years 5 months ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
121
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...
125
click to vote
ADCM
2007
15 years 3 months ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical diļ¬erentiation. Under an a priori and an a posteriori choice r...
135
click to vote
CPC
2008
15 years 3 months ago
2008
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
109
Voted
JIRS
2006
15 years 3 months ago
2006
This paper deals with a novel method of continuous-time model-predictive control for nonlinear time-delayed systems. The problems relating to time delays are solved by incorporatin...