1127 search results - page 102 / 226 » New Algorithms for Generalized Network Flows |
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
Recurrent neural networks are theoretically capable of learning complex temporal sequences, but training them through gradient-descent is too slow and unstable for practical use i...
115
click to vote
FPGA
2000
ACM
15 years 2 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Gravity model used to model transport flow has proven invaluable in urban planning. Some recent work has proposed to use gravity model to predict user movements in cellular net...
KDD
2009
ACM
15 years 11 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
67
Voted
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...