594 search results - page 116 / 119 » A Note on Concepts and Distances |
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
CLA
2007
13 years 9 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
AIM
2006
13 years 9 months ago
2006
: The development of the tools of Business Process Management (BPM) arises from the spread of the notion of process in the management universe. The application of BPM to strategic ...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
Many-objective problems are difficult to solve using conventional multi-objective evolutionary algorithms (MOEAs) as these algorithms rely primarily on Pareto ranking to guide the ...