4865 search results - page 766 / 973 » The Complexity of Graph Connectivity |
136
click to vote
WABI
2001
Springer
15 years 8 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
171
click to vote
BPM
2006
Springer
15 years 8 months ago
2006
Springer
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
150
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
155
Voted
AI
2010
Springer
15 years 4 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
179
Voted
COMGEO
2006
ACM
15 years 4 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...