999 search results - page 60 / 200 » Constraints in Non-Boolean Contexts |
173
click to vote
IS
2007
15 years 6 months ago
2007
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
163
click to vote
COLING
2010
15 years 1 months ago
2010
Near-synonyms are useful knowledge resources for many natural language applications such as query expansion for information retrieval (IR) and paraphrasing for text generation. Ho...
172
click to vote
DALT
2010
Springer
15 years 1 months ago
2010
Springer
Commitment-based interaction protocols are a flexible way of representing the interaction of a set of agents, that are well-known and widely accepted by the research community. Nor...
153
click to vote
MP
1998
15 years 5 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
167
click to vote
SP
2002
IEEE
15 years 5 months ago
2002
IEEE
Markov models have been used extensively in psychology of learning. Applications of hidden Markov models are rare however. This is partially due to the fact that comprehensive stat...