Exploració per autor "Meseguer González, Pedro"

Ara es mostren els items 1-4 de 4

    • A cryptographic solution for private distributed simple meeting scheduling 

      Herranz Sotoca, Javier; Matwin, Stan; Meseguer González, Pedro; Nin Guerrero, Jordi (IOS Press, 2009)
      Text en actes de congrés
      Accés obert
      Meeting scheduling is a suitable application for distributed computation motivated by its privacy requirements. Previous work on this problem have considered some cryptographic and conceptually clear approach to solve a ...

    • Constraint satisfaction as global optimization 

      Meseguer González, Pedro; Larrosa Bondia, Francisco Javier (1995-06)
      Report de recerca
      Accés obert
      We present an optimization formulation for discrete binary CSP, based on the construction of a continuous function A(P) whose global maximum represents the best possible solution for that problem. By the best possible ...

    • Generic CSP techniques for the job-shop problem 

      Larrosa Bondia, Francisco Javier; Meseguer González, Pedro (1997-11)
      Report de recerca
      Accés obert
      The job-shop is a classical problem in manufacturing, arising daily in factories and workshops. From an AI perspective, the job-shop is a constraint satisfaction problem (CSP), and many specific techniques have been developed ...

    • Partial lazy forward checking 

      Larrosa Bondia, Francisco Javier; Meseguer González, Pedro (1997-11)
      Report de recerca
      Accés obert
      Partial forward checking (PFC) may perform more consistency checks than really needed to detect dead-ends in MAX-CSP. After analyzing PFC, we have identified four causes of redundant check computation: (a) unnecessary ...