6045 search results - page 121 / 1209 » Computable Linearizations of Well-partial-orderings |
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
TIME
2003
IEEE
14 years 1 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
KR
2010
Springer
14 years 24 days ago
2010
Springer
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract-- We consider here the problem of finding a controller such that when interconnected to the plant, we obtain a system which is asymptotically equivalent to a desired syste...
PC
2011
13 years 3 months ago
2011
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...