674 search results - page 55 / 135 » Subwebs for specialized search |
DELOS
2001
13 years 9 months ago
2001
We describe an approach to personalization that emphasizes the "client side." We posit the need for a highly individualistic user context that resides on the client mach...
SERP
2003
13 years 9 months ago
2003
Abstract New algorithms are constantly developed in search of better or faster results. Many variants of code are often tried while searching for the best solution. When the number...
AAAI
1996
13 years 9 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
EACL
1993
ACL Anthology
13 years 9 months ago
1993
ACL Anthology
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
ANOR
2010
13 years 7 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...