505 search results - page 48 / 101 » On A Graph Formalism for Ordered Edges |
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
ASUNAM
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
180
click to vote
ASUNAM
2011
IEEE
13 years 9 months ago
2011
IEEE
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
MODELS
2007
Springer
15 years 3 months ago
2007
Springer
The integration of different models, such as scenarios, is an important component of the requirements engineer’s work. If manually performed, the integration operation is error-...
AOSE
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy, cooperation, and goal-oriented behavior. Mainstream object-ori...