Sciweavers

1814 search results - page 196 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
VLSID
2002
IEEE
135views VLSI» more  VLSID 2002»
16 years 7 months ago
An Efficient Algorithm for Low Power Pass Transistor Logic Synthesis
In this paper, we address the problem of power dissipation minimization in combinational circuits implemented using pass transistor logic (PTL). We transform the problem of power ...
Rupesh S. Shelar, Sachin S. Sapatnekar
CEC
2009
IEEE
16 years 1 months ago
Evolutionary programming with ensemble of explicit memories for dynamic optimization
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
Ling Yu, Ponnuthurai N. Suganthan
ICASSP
2009
IEEE
16 years 1 months ago
L1 regularized super-resolution from unregistered omnidirectional images
In this paper, we address the problem of super-resolution from multiple low-resolution omnidirectional images with inexact registration. Such a problem is typically encountered in...
Zafer Arican, Pascal Frossard
CEC
2008
IEEE
16 years 1 months ago
Dynamic adaptation and multiobjective concepts in a particle swarm optimizer for constrained optimization
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
Jorge Isacc Flores-Mendoza, Efrén Mezura-Mo...
GBRPR
2005
Springer
16 years 2 days ago
Reactive Tabu Search for Measuring Graph Similarity
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
Sébastien Sorlin, Christine Solnon