Robustness on resource allocation problems
Tesis doctoral de Víctor Muñoz SolÁ En problemas de asignación de recursos, normalmente se han de tener en cuenta las […]
Tesis doctoral de felip Manyá serres
Información academica felip Manyá serres. Tesis donde felip Manyá serres ha sido autor, director o parte del tribunal.
Csp problemas as algorithmic benchmarks: measures, methods and models
Tesis doctoral de Carlos Mateu Piñol Part of the current research in artificial intelligence is focused in resolving and studying
Systematic and local search algorithms for regular-sat
Tesis doctoral de Ramon Bejar Torres Regular-sat es el problema de decidir la satisfactibilidad de una clase de fórmulas proposicionales
A new framework for max-sat solving
Tesis doctoral de Federico Heras Viaga The propositional satisfiability problem (sat) is the problem of determining whether a truth assignment
Design and implementation of exact max-sat solvers
Tesis doctoral de Jordi Planes Cid El problema de la satisfactibilidad (sat) es el problema que trata de decidir si
Logic programming with fuzzy unifiction constants: possibililistic semantics and automated deduction
Tesis doctoral de M.teresa Alsinet Bernado Datos académicos de la tesis doctoral «Logic programming with fuzzy unifiction constants: possibililistic
Complete sat solvers for many-valued cnf formulas
Tesis doctoral de Carlos José Ansótegui Gil Sats is formally defined as the problem of deciding the satisfiability of a