3678 search results - page 304 / 736 » On the Stable Paths Problem |
216
click to vote
TEC
2010
15 years 1 months ago
2010
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
171
click to vote
SIROCCO
2010
15 years 8 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
169
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
169
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
176
click to vote
ICDCSW
2005
IEEE
16 years 10 days ago
2005
IEEE
The core problem in risk analysis - determining exploitable paths between attackers and system assets is essentially a problem of determining information flow. It is relatively st...