1289 search results - page 110 / 258 » Complexity of Counting the Optimal Solutions |
SYNASC
2006
IEEE
15 years 4 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...
MCS
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...
CEC
2005
IEEE
14 years 12 months ago
2005
IEEE
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
151
click to vote
TCAD
2011
14 years 4 months ago
2011
—Escalating system-on-chip design complexity is the design community to raise the level of abstraction beyond register transfer level. Despite the unsuccessful adoptions of early...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...