16091 search results - page 349 / 3219 » Solving |
203
click to vote
WISE
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. We present a goal-based approach for visualizing and browsing the search space of available Web services. A goal describes an obthat a client wants to solve by using Web ...
203
Voted
CP
2007
Springer
16 years 26 days ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
163
click to vote
CPM
2007
Springer
16 years 26 days ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
155
click to vote
CSR
2007
Springer
16 years 26 days ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
159
click to vote
GBRPR
2007
Springer
16 years 25 days ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...