824 search results - page 12 / 165 » Weighted Low-Rank Approximations |
WG
2007
Springer
14 years 2 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
EUSFLAT
2009
13 years 6 months ago
2009
Abstract-- Recently, many scholars investigated interval, triangular, and trapezoidal approximations of fuzzy numbers. These researches can be grouped into two classes: the Euclide...
IPL
2006
13 years 8 months ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
ILP
2003
Springer
14 years 1 months ago
2003
Springer
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
COCOON
2004
Springer
14 years 1 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...