2796 search results - page 265 / 560 » The coolest path problem |
170
Voted
JOIN
2007
15 years 6 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
181
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
195
click to vote
TC
2008
15 years 6 months ago
2008
To support dynamic address translation in today's microprocessors, the first-level cache is accessed in parallel with a translation lookaside buffer (TLB). However, this curre...
144
click to vote
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
As the network technology has been developed, the Next Generation Internet (NGI) such as Internet2, KOREN, KREONET2 and etc has been deployed to support bandwidth of Giga bps. And,...
226
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....