17366 search results - page 416 / 3474 » New Revision Algorithms |
188
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
188
click to vote
EJC
2008
15 years 7 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
194
click to vote
ISCI
2008
15 years 6 months ago
2008
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...
239
click to vote
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
142
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...