2796 search results - page 481 / 560 » The coolest path problem |
136
click to vote
ISAAC
1995
Springer
15 years 8 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
157
click to vote
IAT
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
132
click to vote
AAAI
2008
15 years 7 months ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
148
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
145
click to vote
CONEXT
2008
ACM
15 years 7 months ago
2008
ACM
We consider the problem of improving network capacity in wireless mesh networks from the angle of multi-flow diversity. As consecutive packets on a multihop path can interfere wit...