In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
Effective problem-solving about complex engineered devices requires device models that are both adequate for the problem and computationally efficient . Producing such models requ...
P. Pandurang Nayak, Leo Joskowicz, Sanjaya Addanki
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...