6562 search results - page 118 / 1313 » Noetherianity and Combination Problems |
113
Voted
SAS
2005
Springer
15 years 10 months 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...
112
Voted
ACL
2006
15 years 6 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...
145
click to vote
AIPS
1994
15 years 6 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...
138
Voted
ICNC
2009
Springer
15 years 11 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...
120
click to vote
CEC
2008
IEEE
15 years 11 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...