Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resoluti...
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...
An approach of doing register allocation beyond basic blocks for low energy is presented in this paper. With careful analysis of boundary conditions between consecutive blocks, ou...
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...