Sciweavers

3250 search results - page 33 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
14 years 2 days ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
PPDP
2010
Springer
13 years 6 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
IJCGA
2000
64views more  IJCGA 2000»
13 years 8 months ago
High Fidelity Interval Assignment
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...
Scott A. Mitchell
PC
2008
158views Management» more  PC 2008»
13 years 8 months ago
Application of multistage stochastic programs solved in parallel in portfolio management
We present a multistage model for allocation of financial resources to bond indices in different currencies. The model was tested on historical data of interest and exchange rates...
Mária Lucká, Igor Melichercik, Ladis...
MCU
2004
129views Hardware» more  MCU 2004»
13 years 9 months ago
Solving 3CNF-SAT and HPP in Linear Time Using WWW
We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resour...
Florin Manea, Carlos Martín-Vide, Victor Mi...