526 search results - page 60 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
BMCBI
2006
14 years 9 months ago
2006
Background: Dynamic modeling of metabolic reaction networks under in vivo conditions is a crucial step in order to obtain a better understanding of the (dis)functioning of living ...
134
click to vote
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...
TOPLAS
2008
14 years 9 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
167
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...
MP
2006
14 years 9 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...