2796 search results - page 515 / 560 » The coolest path problem |
105
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
104
click to vote
WSC
2000
15 years 1 months ago
2000
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
TIT
2008
14 years 11 months ago
2008
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
DATE
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper, we present an approach to synthesize multiple behavior modules. Given n DFGs to be implemented, the previous methods scheduled each of them sequentially, and implem...
105
click to vote
ICCAD
1998
IEEE
15 years 4 months ago
1998
IEEE
Designers of distributed embedded systems face many challenges in determining the appropriate tradeoffs to make when defining a system architecture or retargeting an existing desi...