Sciweavers

966 search results - page 108 / 194
» Small Alliances in Graphs
Sort
View
AUTOMATICA
2007
92views more  AUTOMATICA 2007»
13 years 10 months ago
Observability analysis for structured bilinear systems: A graph-theoretic approach
This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express ...
T. Boukhobza, Frédéric Hamelin
DM
2006
128views more  DM 2006»
13 years 10 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
CIKM
2007
Springer
14 years 4 months ago
RDF data exploration and visualization
We present Paged Graph Visualization (PGV), a new semiautonomous tool for RDF data exploration and visualization. PGV consists of two main components: a) the “PGV explorer” an...
Leonidas Deligiannidis, Krys Kochut, Amit P. Sheth
ECP
1997
Springer
103views Robotics» more  ECP 1997»
14 years 2 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 5 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
Alan M. Frieze, Charalampos E. Tsourakakis