207 search results - page 17 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
ESANN
2000
15 years 1 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
112
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
TCS
2010
14 years 10 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
101
click to vote
CEC
2009
IEEE
15 years 3 months ago
2009
IEEE
VANETs are ad hoc networks in which devices are vehicles moving at high speeds. This kind of network is getting more and more importance since it has many practical and important a...
MP
2007
14 years 11 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...