16091 search results - page 328 / 3219 » Solving |
172
click to vote
AISB
1995
Springer
15 years 10 months ago
1995
Springer
This paper presents an evolutionary algorithm for solving parameter optimization problems in parametric array signal processing. The method utilises the niche concept to maintain a...
209
click to vote
RTA
1991
Springer
15 years 10 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
143
click to vote
CAV
2010
Springer
15 years 9 months ago
2010
Springer
Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with -regular objectives; and (b) synthesizes reasonable environment assumptions f...
144
click to vote
AAAI
2007
15 years 9 months ago
2007
Russian Doll Search (RDS) is a well-known algorithm for combinatorial optimization. In this paper we extend it from mono-objective to multi-objective optimization. We demonstrate ...
202
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...