6095 search results - page 1018 / 1219 » Learning in Local Search |
156
Voted
IJCAI
2001
15 years 6 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
146
click to vote
NIPS
2004
15 years 6 months ago
2004
Spike sorting involves clustering spike trains recorded by a microelectrode according to the source neuron. It is a complicated problem, which requires a lot of human labor, partl...
165
Voted
IJCAI
2003
15 years 6 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
125
click to vote
GRAPHICSINTERFACE
1997
15 years 6 months ago
1997
This paper presents a method for generating compact and effective constructive-solid-geometry (CSG) object representations from 2D bitmap representations. The method consists of t...
141
click to vote
ISMB
1997
15 years 6 months ago
1997
The structural comparison of proteins has become increasingly important as a means to identify protein motifs and fold families. In this paper we present a new algorithm for the c...