Sciweavers

365 search results - page 39 / 73
» An Approach to Multiply Segmented Constraint Satisfaction Pr...
Sort
View
105
Voted
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 1 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
131
Voted
ISDA
2010
IEEE
14 years 10 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
FCCM
1999
IEEE
111views VLSI» more  FCCM 1999»
15 years 4 months ago
Optimizing FPGA-Based Vector Product Designs
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
Dan Benyamin, John D. Villasenor, Wayne Luk
104
Voted
AAAI
2006
15 years 1 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
98
Voted
CVPR
1998
IEEE
16 years 2 months ago
Incorporating Illumination Constraints in Deformable Models
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
Dimitris Samaras, Dimitris N. Metaxas