Sciweavers

824 search results - page 32 / 165
» Weighted Low-Rank Approximations
Sort
View
WDAG
2009
Springer
195views Algorithms» more  WDAG 2009»
14 years 3 months ago
A Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
Matti Åstrand, Patrik Floréen, Valent...
ISCAS
1999
IEEE
73views Hardware» more  ISCAS 1999»
14 years 23 days ago
Correlation learning rule in floating-gate pFET synapses
We study the weight dynamics of the floating-gate pFET synapse and the effects of the pFET's gate and drain voltages on these dynamics. We show that we can derive a weight upd...
Paul E. Hasler, Jeff Dugger
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
14 years 4 days ago
Fitness function for finding out robust solutions on time-varying functions
Evolutionary Computations in dynamic/uncertain environments have attracted much attention. Studies regarding this research subjects can be classified into four categories: Noise, ...
Hisashi Handa
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 8 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
CONCUR
2012
Springer
11 years 11 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman