Sciweavers

13376 search results - page 391 / 2676
» Problem Solving with
Sort
View
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
15 years 9 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 3 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
SEMWEB
2010
Springer
15 years 2 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
ICASSP
2010
IEEE
15 years 5 months ago
Efficient weighted-sum-rate maximization for a class of half-duplex cooperative systems
In many half-duplex cooperative systems, the direct formulation of the problem of finding the jointly optimal power and channel resource allocation that maximizes a weighted sum ...
Wessam Mesbah, Timothy N. Davidson
140
Voted
ENDM
2000
174views more  ENDM 2000»
15 years 4 months ago
Hybrid Constraints in Automated Model Synthesis and Model Processing
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...
Klaus-Ulrich Leweling, Benno Stein