Research Publications
All | |
| Narrow your search | 283 result(s) |
By Type
By Year By Research Group | The Internet Engineering Task Force develops and promotes Internet standards like TCP/IP. The chair of the Task Force is chosen by an election which starts with a set of voters being selected at random from the electorate of volunteers. Selecting ... The Maximum Density Still Life Problem (CSPLib prob032) is to find the maximum number of live cells that can fit in an n × n region of an infinite board, so that the board is stable under the rules of Conway’s Game of Life. It is considered a very ... Lazy clause generation is a powerful approach to reducing search in constraint programming. For use in a lazy clause generation solver, global constraints must be extended to explain themselves. In this paper we present two new generic flow-based ... The Resource-constrained Project Scheduling Problem (RCPSP) is one of the most studied scheduling problems in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities. An important variation... Smooth decomposable negation normal form (s-DNNF) circuits are a compact form of representing many Boolean functions, that permit linear time satisfiability checking. Given a constraint defined by an s-DNNF circuit, we can create a propagator for the ... Robust search procedures are a central component in the de- sign of black-box constraint-programming solvers. This paper proposes activity-based search which uses the activity of variables during propaga- tion to guide the search. Activity-based search... This paper considers the joint repair and restoration of the electrical power system after significant disruptions caused by natural disasters. This problem is computationally challenging because, when the goal is to minimize the size of the blackout, ... This paper proposes an abstraction of emerging vehicle routing problems, the Vehicle Routing Problem with Black Box Feasibility. In this problem the routes of a basic VRP need to satisfy an unknown set of constraints. A black box function is provided ... look at one of the problems faced by companies delivering directly to customers on a regular basis. The question we ask is, How does a company identify which of their customers are no longer profitable? That is, we wish to identify those customers for... |