Sciweavers

1816 search results - page 43 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
AAAI
2006
15 years 1 months ago
An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
We present an asymptotically optimal algorithm for the max variant of the k-armed bandit problem. Given a set of k slot machines, each yielding payoff from a fixed (but unknown) d...
Matthew J. Streeter, Stephen F. Smith
VLSID
1999
IEEE
111views VLSI» more  VLSID 1999»
15 years 4 months ago
A New Approach for CMOS Op-Amp Synthesis
A new approach for CMOS op-amp circuit synthesis has proposed here. The approach is based on the observation that the rst order behavior of a MOS transistor in the saturation regi...
Pradip Mandal, V. Visvanathan
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
16 years 4 days ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
CEC
2010
IEEE
14 years 9 months ago
A hybrid multi-objective extremal optimisation approach for multi-objective combinatorial optimisation problems
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
Pedro Gómez-Meneses, Marcus Randall, Andrew...
ITC
2003
IEEE
146views Hardware» more  ITC 2003»
15 years 5 months ago
A New Approach for Low Power Scan Testing
As semiconductor manufacturing technology advances, power dissipation and noise in scan testing has become a critical problem. In our studies on practical LSI manufacturing, we ha...
Takaki Yoshida, Masafumi Watari