Sciweavers

417 search results - page 41 / 84
» In Search of the Best Constraint Satisfaction Search
Sort
View
KBS
2007
56views more  KBS 2007»
14 years 9 months ago
Domain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
CP
2008
Springer
14 years 11 months ago
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
Eric I. Hsu, Christian J. Muise, J. Christopher Be...
AAAI
1997
14 years 11 months ago
Bayes Networks for Estimating the Number of Solutions to a CSP
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
NOMS
2000
IEEE
141views Communications» more  NOMS 2000»
15 years 2 months ago
IconoNET: a tool for automated bandwidth allocation planning
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
Christian Frei, Boi Faltings, George Melissargos, ...
CSCW
2012
ACM
13 years 5 months ago
Friends, romans, countrymen: lend me your URLs. using social chatter to personalize web search
People often find useful content on the web via social media. However, it is difficult to manually aggregate the information and recommendations embedded in a torrent of social ...
Abhinay Nagpal, Sudheendra Hangal, Rifat Reza Joye...