2606 search results - page 61 / 522 » cost 2008 |
155
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
: For an infinite-horizon optimal control problem, the cost does not, in general, converge. The classical work-around to this problem is to introduce a discount or "forgetting...
176
click to vote
JC
2008
15 years 6 months ago
2008
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
166
click to vote
JCO
2008
15 years 6 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
185
click to vote
NETWORKS
2008
15 years 6 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
151
click to vote
TKDE
1998
15 years 6 months ago
1998
—We present a new access method, called the path dictionary index (PDI) method, for supporting nested queries on object-oriented databases. PDI supports object traversal and asso...