270 search results - page 18 / 54 » A Simple and General Theoretical Account for Abstract Types |
ANOR
2007
13 years 7 months ago
2007
Abstract This paper is devoted to bilevel optimization, a branch of mathematical programming of both practical and theoretical interest. Starting with a simple example, we proceed ...
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Functional nets combine key ideas of functional programming and Petri nets to yield a simple and general programming notation. They have their theoretical foundation in J...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
ERSHOV
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
PSSE
2004
Springer
14 years 1 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...