Sciweavers

2743 search results - page 56 / 549
» Minimization of an M-convex Function
Sort
View
SETA
2004
Springer
126views Mathematics» more  SETA 2004»
14 years 2 months ago
Algebraic Feedback Shift Registers Based on Function Fields
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations o...
Andrew Klapper
CATS
2008
13 years 10 months ago
A Multidimensional Bisection Method for Unconstrained Minimization Problem
An extension of a new multidimensional bisection method for minimizing function over simplex is proposed for solving nonlinear unconstrained minimization problem. The method does ...
Elena Morozova
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
13 years 9 months ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov
ISMVL
2008
IEEE
160views Hardware» more  ISMVL 2008»
14 years 3 months ago
Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares
Compact realizations of reversible logic functions are of interest in the design of quantum computers. In this paper we present an exact synthesis algorithm, based on Boolean Sati...
Daniel Große, Robert Wille, Gerhard W. Dueck...
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
14 years 3 months ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak