In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
This paper presents a new construction management cooperated with clients using a parametric information design method for road construction. This management has been found to be e...
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
Raquel Fuentetaja, Daniel Borrajo, Carlos Linares ...
In this paper we propose a passive conformance testing technique applied to a Mobile ad hoc network (MANET) routing protocol, OLSR, that is characterized by a dynamically changing...