9532 search results - page 187 / 1907 » Logic, Graphs, and Algorithms |
151
click to vote
AIPS
2010
15 years 6 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
118
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
117
click to vote
DM
2008
15 years 4 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
172
click to vote
LION
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
133
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...