270 search results - page 25 / 54 » Exploiting Problem Structure for Solution Counting |
SYNASC
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Problems in which some entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategie...
IPCO
2008
14 years 11 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
CCE
2004
14 years 9 months ago
2004
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
A precoding strategy for multi-user spectrum sharing over an interference channel is proposed and analyzed from a game-theoretic perspective. The proposed strategy is based on fi...