Sciweavers

3838 search results - page 390 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Meta-heuristics for Circuit Partitioning in Parallel Test Generation
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
Consolación Gil, Julio Ortega, Antonio F. D...
177
Voted
ICML
2006
IEEE
16 years 7 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
ICPR
2008
IEEE
16 years 1 months ago
Fast model selection for MaxMinOver-based training of support vector machines
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
Fabian Timm, Sascha Klement, Thomas Martinetz
ASPDAC
2007
ACM
102views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Clock Skew Scheduling with Delay Padding for Prescribed Skew Domains
Clock skew scheduling is a technique that intentionally introduces skews to memory elements to improve the performance of a sequential circuit. It was shown in [21] that the full ...
Chuan Lin, Hai Zhou
AAAI
2004
15 years 8 months ago
Solving Concurrent Markov Decision Processes
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
Mausam, Daniel S. Weld