Sciweavers

1483 search results - page 13 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
GLOBECOM
2006
IEEE
14 years 5 months ago
Optimal Resource Allocation via Geometric Programming for OFDM Broadcast and Multiple Access Channels
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...
Kibeom Seong, David D. Yu, Youngjae Kim, John M. C...
ICCVW
1999
Springer
14 years 3 months ago
Uncertainty Modeling for Optimal Structure from Motion
The parameters estimated by Structure from Motion SFM contain inherent indeterminacies which we call gauge freedoms. Under a perspective camera, shape and motion parameters are o...
Daniel D. Morris, Ken-ichi Kanatani, Takeo Kanade
IJCAI
2003
14 years 8 days ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov
CP
1995
Springer
14 years 2 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
HIS
2004
14 years 9 days ago
Q'tron Neural Networks for Constraint Satisfaction
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
Tai-Wen Yue, Mei-Ching Chen