9532 search results - page 369 / 1907 » Logic, Graphs, and Algorithms |
180
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
174
click to vote
ER
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
191
click to vote
NETWORKS
2002
15 years 6 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
194
click to vote
TIT
2010
15 years 1 months ago
2010
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
178
click to vote
ICAIL
2003
ACM
16 years 13 hour ago
2003
ACM
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...