719 search results - page 57 / 144 » Solving Sparse Linear Constraints |
IOR
2010
14 years 8 months ago
2010
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
103
click to vote
CP
2006
Springer
15 years 2 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
AAAI
2007
15 years 1 months ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
110
click to vote
ICMLC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...
122
click to vote
CVPR
1997
IEEE
15 years 3 months ago
1997
IEEE
ÐWe describe a new direct method for estimating structure and motion from image intensities of multiple views. We extend the direct methods of Horn and Weldon [18] to three views....