Mostrar el registro sencillo del ítem

A parallel logic programming approach to job shop scheduling constraint satisfaction problems

dc.contributor.authorPuente Peinador, Jorge 
dc.contributor.authorVarela Arias, José Ramiro 
dc.contributor.authorRodríguez Vela, María del Camino 
dc.contributor.authorAlonso González, César Luis 
dc.date.accessioned2015-07-15T07:16:40Z
dc.date.available2015-07-15T07:16:40Z
dc.date.issued1998
dc.identifier.citationAGP, 98, p. 29-41 (1998)
dc.identifier.urihttp://hdl.handle.net/10651/31964
dc.descriptionCongreso APPIA-GULP-PRODE'98 Joint Conference on Declarative Programming ( La Coruña. 1998)
dc.description.abstractIn this paper we put together a Parallel Logic Programming schema and a heuristic search strategy in order to solve constraint satisfaction problems. The idea is to introduce heuristic information in the construction of logic programs in order to improve the performance. The experimental results show that logic programs can be designed that exhibit parallelism, and that the use of heuristic information translates into speedup in obtaining answersspa
dc.format.extentp. 29-41spa
dc.language.isoengspa
dc.relation.ispartofAGP, 98spa
dc.rights© J. Puente et al.
dc.titleA parallel logic programming approach to job shop scheduling constraint satisfaction problemseng
dc.typeconference outputspa
dc.rights.accessRightsopen accessspa
dc.type.hasVersionAM


Ficheros en el ítem

untranslated

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem