7930 search results - page 350 / 1586 » Greedy in Approximation Algorithms |
146
Voted
DAC
1998
ACM
15 years 11 months ago
1998
ACM
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
150
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We demonstrate that enhanced particle swarm optimization (PSO) can be successfully used to evolve high performance filter approximations. These evolved approximations use sets of ...
162
click to vote
AAECC
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
173
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
157
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...