1788 search results - page 93 / 358 » The Language of Search |
CP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
CP
2004
Springer
14 years 1 months ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
TSD
2000
Springer
13 years 11 months ago
2000
Springer
In text processing systems German words require special treatment because of the possibility to form compound words as a combination of existing words. To this end, a universal wor...
AAAI
2000
13 years 9 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
CIKM
2003
Springer
14 years 1 months ago
2003
Springer
Out of vocabulary (OOV) words are problematic for cross language information retrieval. One way to deal with OOV words when the two languages have different alphabets, is to trans...