Sciweavers

2182 search results - page 170 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 10 months ago
Distributed Constrained Optimization with Semicoordinate Transformations
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
William G. Macready, David Wolpert
105
Voted
MP
2008
115views more  MP 2008»
14 years 10 months ago
An efficient approach to updating simplex multipliers in the simplex algorithm
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
Jian-Feng Hu, Ping-Qi Pan
79
Voted
ICASSP
2010
IEEE
14 years 10 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
COR
2007
97views more  COR 2007»
14 years 10 months ago
Two-stage general block patterns for the two-dimensional cutting problem
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
Yaodong Cui, Xianquan Zhang
93
Voted
ICLP
2010
Springer
15 years 2 months ago
Abductive Inference in Probabilistic Logic Programs
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
Gerardo I. Simari, V. S. Subrahmanian