4110 search results - page 427 / 822 » Efficient algorithms for the 2-gathering problem |
206
click to vote
NIPS
2001
15 years 8 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
188
click to vote
ISMB
1994
15 years 8 months ago
1994
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
192
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We study an interesting and challenging problem, online streaming feature selection, in which the size of the feature set is unknown, and not all features are available for learni...
186
click to vote
DEXA
2010
Springer
15 years 7 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
177
click to vote
COR
2010
15 years 7 months ago
2010
In this paper we present a new evolutionary method for complex-process optimization. It is partially based on principles of the scatter search methodology, but it makes use of inn...