Sciweavers

849 search results - page 25 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
SPAA
2010
ACM
13 years 8 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
EOR
2008
159views more  EOR 2008»
13 years 7 months ago
A survey on the continuous nonlinear resource allocation problem
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
Michael Patriksson
ESANN
1998
13 years 9 months ago
A neural approach to a sensor fusion problem
Our problem concerns the joint interpretation of UltraSonic and InfraRed measurements provided by a composite proximity sensor, in order to extract geometrical and morphological f...
Valentina Colla, Mirko Sgarbi, Leonardo Maria Reyn...
DLT
2007
13 years 9 months ago
State Complexity of Union and Intersection of Finite Languages
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
Yo-Sub Han, Kai Salomaa
MP
2008
101views more  MP 2008»
13 years 7 months ago
Accelerating the cubic regularization of Newton's method on convex problems
In this paper we propose an accelerated version of the cubic regularization of Newton's method [6]. The original version, used for minimizing a convex function with Lipschitz...
Yu. Nesterov