Sciweavers

1736 search results - page 118 / 348
» The rank-width of Directed Graphs
Sort
View
AGTIVE
2003
Springer
15 years 9 months ago
Integrating Graph Rewriting and Standard Software Tools
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
Uwe Aßmann, Johan Lövdahl
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 11 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
CSUR
1999
159views more  CSUR 1999»
15 years 4 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
CVPR
2005
IEEE
16 years 6 months ago
Energy Minimization via Graph Cuts: Settling What is Possible
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
Daniel Freedman, Petros Drineas
COSIT
2009
Springer
129views GIS» more  COSIT 2009»
15 years 11 months ago
Semi-automated Derivation of Conceptual Neighborhood Graphs of Topological Relations
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph...
Yohei Kurata