Sciweavers

886 search results - page 72 / 178
» Reasoning with contextual graphs
Sort
View
ICCBR
2007
Springer
15 years 10 months ago
An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs
We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link co...
Thomas Gabel, Martin Riedmiller
AGTIVE
2007
Springer
15 years 8 months ago
Specifying Domain-Specific Refactorings for AndroMDA Based on Graph Transformation
Abstract. Applying refactoring in a model-driven software engineering context raises many new challenges that need to be addressed. In this paper, we consider model-driven software...
Gabriele Taentzer, Dirk Müller 0002, Tom Mens
CSJM
2006
76views more  CSJM 2006»
15 years 4 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
MFCS
2005
Springer
15 years 9 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
ESOP
2004
Springer
15 years 9 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink