Sciweavers

1383 search results - page 188 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
MP
2008
129views more  MP 2008»
15 years 6 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
EOR
2007
80views more  EOR 2007»
15 years 6 months ago
The tool switching problem revisited
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...
Yves Crama, Linda S. Moonen, Frits C. R. Spieksma,...
KI
2006
Springer
15 years 6 months ago
A New n-ary Existential Quantifier in Description Logics
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
15 years 6 months ago
Robust optimal control of regular languages
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
Constantino M. Lagoa, Jinbo Fu, Asok Ray
TCS
2008
15 years 6 months ago
The weak lambda calculus as a reasonable machine
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
Ugo Dal Lago, Simone Martini