6456 search results - page 60 / 1292 » Constraint Solving on Terms |
158
Voted
CIMCA
2006
IEEE
16 years 4 days ago
2006
IEEE
Coalition formation is a process to form a group and solve a problem via cooperation. Because of the rising of network, each computing device can communicate through network. We c...
179
click to vote
DATESO
2007
15 years 7 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
139
click to vote
ECAIW
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
143
click to vote
TASLP
2010
15 years 24 days ago
2010
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
164
click to vote
SIGIR
2006
ACM
16 years 21 hour ago
2006
ACM
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...