14518 search results - page 249 / 2904 » Two Problems for Sophistication |
103
Voted
AAAI
1998
15 years 2 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
157
Voted
IJCAI
1989
15 years 2 months ago
1989
One view of expert system development separates the endeavor into two parts. First, a domain expert, with the aid of a knowledge engineer, articulates a procedure for performing t...
111
Voted
APPML
2007
15 years 29 days ago
2007
This note is devoted to the effect of topography on geophysical flows. We consider two models derived from shallow water theory: the quasigeostrophic equation and the lake equati...
91
Voted
COR
2008
15 years 28 days ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
100
click to vote
DISOPT
2008
15 years 27 days ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...