Sciweavers

238 search results - page 47 / 48
» Planning as Satisfiability
Sort
View
COR
2006
82views more  COR 2006»
13 years 7 months ago
Batching work and rework processes with limited deterioration of reworkables
We study the problem of planning the production of new and recovering defective items of the same product manufactured on the same facility. Items of the product are produced in b...
Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov,...
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
PSYCHNOLOGY
2006
70views more  PSYCHNOLOGY 2006»
13 years 7 months ago
Navigating Information Space: Web site design and lessons from the built environment
The Web is the archetypal information space but even on a well designed site it can be difficult to find all the information you need. It is impossible to design a site so that al...
David Benyon
TSC
2008
209views more  TSC 2008»
13 years 7 months ago
Effective Web Service Composition in Diverse and Large-Scale Service Networks
Web services are considered to be a potential silver bullet for the envisioned Service Oriented Architecture, in which loosely coupled software components are published, located, a...
Seog-Chan Oh, Dongwon Lee, Soundar R. T. Kumara
AMAI
1999
Springer
13 years 7 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä