Sciweavers

3708 search results - page 593 / 742
» Approximating Betweenness Centrality
Sort
View
ECML
2005
Springer
15 years 6 months ago
Model-Based Online Learning of POMDPs
Abstract. Learning to act in an unknown partially observable domain is a difficult variant of the reinforcement learning paradigm. Research in the area has focused on model-free m...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
ERCIMDL
2005
Springer
124views Education» more  ERCIMDL 2005»
15 years 6 months ago
A Comparison of On-Line Computer Science Citation Databases
This paper examines the difference and similarities between the two on-line computer science citation databases DBLP and CiteSeer. The database entries in DBLP are inserted manual...
Vaclav Petricek, Ingemar J. Cox, Hui Han, Isaac G....
98
Voted
FPL
2005
Springer
149views Hardware» more  FPL 2005»
15 years 6 months ago
Heterogeneity Exploration for Multiple 2D Filter Designs
Many image processing applications require fast convolution of an image with a set of large 2D filters. Field - Programmable Gate Arrays (FPGAs) are often used to achieve this go...
Christos-Savvas Bouganis, Peter Y. K. Cheung, Geor...
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 6 months ago
Morphing methods in evolutionary design optimization
Design optimization is a well established application field of evolutionary computation. However, standard recombination operators acting on the genotypic representation of the d...
Michael Nashvili, Markus Olhofer, Bernhard Sendhof...
MFCS
2005
Springer
15 years 6 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher