6562 search results - page 118 / 1313 » Noetherianity and Combination Problems |
156
click to vote
SAS
2005
Springer
16 years 9 days ago
2005
Springer
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...
148
click to vote
ACL
2006
15 years 8 months ago
2006
Speech recognition problems are a reality in current spoken dialogue systems. In order to better understand these phenomena, we study dependencies between speech recognition probl...
174
click to vote
AIPS
1994
15 years 8 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
174
click to vote
ICNC
2009
Springer
16 years 1 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
157
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...