789 search results - page 110 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
ILP
1998
Springer
15 years 6 months ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
AAAI
2008
15 years 4 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
119
click to vote
PPL
2010
14 years 8 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
147
click to vote
ISTAR
2008
15 years 3 months ago
2008
One major obstacle to requirements engineering (RE) is the growing complexity of today's systems. Such a complexity can only be fficiently by powerful abstraction mechanisms a...
121
click to vote
JMLR
2008
15 years 1 months ago
2008
Many complex control problems require sophisticated solutions that are not amenable to traditional controller design. Not only is it difficult to model real world systems, but oft...