920 search results - page 124 / 184 » Generating Satisfiable Problem Instances |
119
Voted
ICSOC
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...
AAAI
2006
15 years 2 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
124
Voted
TSMC
2010
14 years 7 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
91
Voted
MP
2006
15 years 18 days 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...
137
Voted
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...