1197 search results - page 156 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ISMIS
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
NIPS
2004
13 years 9 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
AR
2007
13 years 8 months ago
2007
—Researchers in robotics and artificial intelligence have often looked at biology as a source of inspiration for solving their problems. From the opposite perspective, neuroscie...
MIG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Motion blending is a popular motion synthesis technique which interpolates similar motion examples according to blending weighs parameterizing high-level characteristics ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...