Sciweavers

1816 search results - page 140 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ERSA
2010
199views Hardware» more  ERSA 2010»
15 years 4 months ago
Reconfigurable Sparse Matrix-Vector Multiplication on FPGAs
Cache-based, general purpose CPUs perform at a small fraction of their maximum floating point performance when executing memory-intensive simulations, such as those required for sp...
Russell Tessier, Salma Mirza, J. Blair Perot
NIPS
2008
15 years 7 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
JMLR
2006
93views more  JMLR 2006»
15 years 6 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
HYBRID
2004
Springer
15 years 12 months ago
On the Optimal Control of Switch-Mode DC-DC Converters
This paper presents a new solution approach to the optimal control problem of fixed frequency switch-mode DC-DC converters using hybrid systems methodologies. In particular, the n...
Tobias Geyer, Georgios Papafotiou, Manfred Morari
FLAIRS
2008
15 years 8 months ago
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
Lukás Chrpa, Roman Barták