Sciweavers

817 search results - page 94 / 164
» Exact solutions to linear programming problems
Sort
View
IJCGA
2000
64views more  IJCGA 2000»
13 years 7 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
LCTRTS
2001
Springer
14 years 4 days ago
A Dynamic Programming Approach to Optimal Integrated Code Generation
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
Christoph W. Keßler, Andrzej Bednarski
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 6 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
SAC
2008
ACM
13 years 7 months ago
Improving denial of service resistance using dynamic local adaptations
We improve the resistance of gossip-based multicast to (Distributed) Denial of Service (DoS) attacks using dynamic local adaptations at each node. Each node estimates the current ...
Gal Badishi, Idit Keidar
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 2 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith