Sciweavers

3591 search results - page 317 / 719
» Typing linear constraints
Sort
View
ANOR
2004
116views more  ANOR 2004»
15 years 7 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
199
Voted
CAD
2000
Springer
15 years 7 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
206
Voted
AI
1999
Springer
15 years 7 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
197
Voted
INFORMS
2010
145views more  INFORMS 2010»
15 years 6 months ago
An Automated Intensity-Modulated Radiation Therapy Planning System
We design and implement an intensity-modulated radiation therapy (IMRT) plan generation technology that effectively and efficiently optimizes beam geometry as well as beam intens...
Shabbir Ahmed, Ozan Gozbasi, Martin W. P. Savelsbe...
ICASSP
2011
IEEE
14 years 11 months ago
Distributed LCMV beamforming in wireless sensor networks with node-specific desired signals
We consider distributed linearly constrained minimum variance (LCMV) beamforming in a wireless sensor network. Each node computes an LCMV beamformer with node-specific constraint...
Alexander Bertrand, Marc Moonen