2693 search results - page 294 / 539 » On Computing Complex Navigation Functions |
194
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
165
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
187
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a new framework for accumulating beliefs in spoken dialogue systems. The technique is based on updating a Bayesian Network that represents the underlying state...
190
click to vote
AICCSA
2006
IEEE
16 years 19 days ago
2006
IEEE
The increased complexity, heterogeneity and the dynamism of networked systems and services make current control and management tools to be ineffective in managing and securing suc...
194
click to vote
CRV
2005
IEEE
16 years 6 days ago
2005
IEEE
The problem of elucidating the functional significance of genes is a key challenge of modern science. Solving this problem can lead to fundamental advancements across multiple are...