18090 search results - page 2883 / 3618 » Computing by Only Observing |
241
click to vote
GECCO
2009
Springer
16 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
191
click to vote
GECCO
2009
Springer
16 years 2 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...
205
click to vote
ICARIS
2009
Springer
16 years 2 months ago
2009
Springer
The sophistication of modern computer malware demands run-time malware detection strategies which are not only efficient but also robust to obfuscation and evasion attempts. In thi...
248
click to vote
ICIAR
2009
Springer
2009
Springer
Interactive Image Segmentation Based on Hierarchical Graph-Cut Optimization with Generic Shape Prior
16 years 2 months ago
Abstract. A new algorithm for interactive image segmentation is proposed. Besides the traditional appearance and gradient information, a new Generic Shape Prior (GSP) knowledge whi...
197
Voted
ICMI
2009
Springer
16 years 2 months ago
2009
Springer
We investigate how fantasy, curiosity and challenge contribute to the user experience in multimodal dialogue computer games for preschool children. For this purpose, an on-line mu...