Sciweavers

5595 search results - page 308 / 1119
» Comparing Subsumption Optimizations
Sort
View
165
Voted
ICIP
2007
IEEE
16 years 1 months ago
Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
Maria Trocan, Béatrice Pesquet-Popescu, Jam...
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
16 years 8 days ago
Timing-driven global routing with efficient buffer insertion
-- Timing optimization is an important goal of global routing in deep submicron era. To guarantee the timing performance of the circuit, merely adopting topology optimization becom...
Jingyu Xu, Xianlong Hong, Tong Jing
LCN
2005
IEEE
16 years 8 days ago
GaMa : An Evolutionary Algorithmic Approach for the Design of Mesh-Based Radio Access Networks
Wireless mesh based access networks are destined to play a pivotal role in next generation broadband systems. With the proliferation of mesh networks, a key issue for network desi...
Samik Ghosh, Preetam Ghosh, Kalyan Basu, Sajal K. ...
GECCO
2004
Springer
16 years 2 days ago
Finding Maximum Cliques with Distributed Ants
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
Thang Nguyen Bui, Joseph R. Rizzo
ISIPTA
2003
IEEE
117views Mathematics» more  ISIPTA 2003»
15 years 12 months ago
Dynamic Programming for Discrete-Time Systems with Uncertain Gain
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
Gert de Cooman, Matthias C. M. Troffaes