Sciweavers

1453 search results - page 131 / 291
» Partial Constraint Satisfaction
Sort
View
CPAIOR
2007
Springer
15 years 10 months ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
ICALP
2010
Springer
15 years 9 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
IFIP12
2004
15 years 5 months ago
A Decision Support System (DSS) for the Railway Scheduling Problem
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
Laura Paola Ingolotti, María Pilar Tormos, ...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 5 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
138
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Direction-resolved estimation of multipath parameters for UWB channels: A partially collapsed Gibbs sampler method
We propose a Monte Carlo method for determining the parameters of multipath components (MPCs) for ultra-wideband channels. A partially collapsed Gibbs sampler is used for jointly ...
Georg Kail, Klaus Witrisal, Franz Hlawatsch