21108 search results - page 275 / 4222 » A General Class of Models of |
196
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
160
click to vote
AAAI
2008
15 years 9 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
177
click to vote
AAAI
2000
15 years 8 months ago
2000
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
151
click to vote
DAM
1998
15 years 6 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
164
click to vote
SIAMJO
2002
15 years 6 months ago
2002
This paper contains a new convergence analysis for the Lewis and Torczon generalized pattern search (GPS) class of methods for unconstrained and linearly constrained optimization. ...