Sciweavers

2109 search results - page 63 / 422
» Solving Necklace Constraint Problems
Sort
View
186
Voted
CORR
2011
Springer
220views Education» more  CORR 2011»
14 years 11 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
CP
2009
Springer
16 years 5 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
ICASSP
2011
IEEE
14 years 8 months ago
Distributed beamforming for OFDM-based cooperative relay networks under total and per-relay power constraints
This paper addresses the problem of beamforming (BF) design for orthogonal frequency division multiplexing (OFDM) based relay networks over frequency-selective channels. Both freq...
Wenjing Cheng, Qinfei Huang, Mounir Ghogho, Dongta...
138
Voted
ENDM
2000
174views more  ENDM 2000»
15 years 4 months ago
Hybrid Constraints in Automated Model Synthesis and Model Processing
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...
Klaus-Ulrich Leweling, Benno Stein
ATAL
2011
Springer
14 years 4 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...