In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Ideation Decks is a project that explores the development of a methodological tool for design ideation. It involves the creation and use of bespoke project-specific card based sys...
The focus of this paper is to provide a framework for the joint optimization of both the coefficient quantization and multiple constant multiplication (MCM) problems. It is known...
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...