738 search results - page 27 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
STACS
2004
Springer
15 years 5 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
SEMWEB
2004
Springer
15 years 5 months ago
2004
Springer
Semantic Web Services enable the dynamic discovery of services based on a formal, explicit specification of the requester needs. The actual Web Services that will be used to satis...
GI
2004
Springer
15 years 5 months ago
2004
Springer
: The development of Web Service compositions has not yet been automated. Web Service-based process definitions can be created automatically using Web Service compositions template...
103
click to vote
CONEXT
2008
ACM
15 years 1 months ago
2008
ACM
Internet service providers (ISPs) depend on one another to provide global network services. However, the profit-seeking nature of the ISPs leads to selfish behaviors that result i...
108
click to vote
NIPS
2004
15 years 1 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...