Sciweavers

7 search results - page 2 / 2
» Solving Non-linear Polynomial Arithmetic via SAT Modulo Line...
Sort
View
CP
2008
Springer
13 years 6 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
JALC
2006
143views more  JALC 2006»
13 years 4 months ago
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gere...