Sciweavers

4342 search results - page 572 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
TEC
2002
163views more  TEC 2002»
15 years 6 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
TPDS
2002
136views more  TPDS 2002»
15 years 6 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
TELSYS
2011
207views Education» more  TELSYS 2011»
15 years 1 months ago
GRASP: basic components and enhancements
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
Paola Festa, Mauricio G. C. Resende
JMLR
2010
125views more  JMLR 2010»
15 years 1 months ago
Variational Relevance Vector Machine for Tabular Data
We adopt the Relevance Vector Machine (RVM) framework to handle cases of tablestructured data such as image blocks and image descriptors. This is achieved by coupling the regulari...
Dmitry Kropotov, Dmitry Vetrov, Lior Wolf, Tal Has...
ICASSP
2011
IEEE
14 years 10 months ago
Saturation-robust SAR image formation
The formation of synthetic aperture radar (SAR) images is formulated as an inverse problem, a flexible approach suitable for a variety of acquisition systems and signal models. T...
Dennis Wei, Petros Boufounos