Sciweavers

2899 search results - page 224 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ALT
2009
Springer
16 years 3 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
INFOCOM
2009
IEEE
16 years 1 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 24 days ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
205
Voted
SEMWEB
2009
Springer
15 years 11 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
EC
2006
136views ECommerce» more  EC 2006»
15 years 6 months ago
Error Thresholds in Genetic Algorithms
The error threshold of replication is an important notion of the quasispecies evolution model; it is a critical mutation rate (error rate) beyond which structures obtained by an e...
Gabriela Ochoa