Search Sciweavers | Sciweavers

667 search results - page 20 / 134

» Approximation algorithms for connected facility location pro...

Voted

ESANN
2000

152views Neural Networks» more ESANN 2000»

An algorithm for the addition of time-delayed connections to recurrent neural networks

14 years 11 months ago

Download www.dice.ucl.ac.be

: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...

Romuald Boné, Michel Crucianu, Jean Pierre ...

claim paper

Read More »

Voted

JAL
2002

71views more JAL 2002»

A primal-dual schema based approximation algorithm for the element connectivity problem

14 years 10 months ago

Download dna.engr.uconn.edu

The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...

Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...

claim paper

Read More »

Voted

JCO
2007

128views more JCO 2007»

Approximation algorithms and hardness results for labeled connectivity problems

14 years 10 months ago

Download www.lamsade.dauphine.fr

Let G = (V, E) be a connected multigraph, whose edges are associated with labels speciﬁed by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...

Refael Hassin, Jérôme Monnot, Danny S...

claim paper

Read More »

click to vote

JCSS
2006

40views more JCSS 2006»

Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems

14 years 10 months ago

Download www.cs.dartmouth.edu

Lisa Fleischer, Kamal Jain, David P. Williamson

claim paper

Read More »