Sciweavers

646 search results - page 90 / 130
» Generalized connected domination in graphs
Sort
View
ICAIL
2009
ACM
14 years 1 months ago
The network of French legal codes
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
Pierre Mazzega, Danièle Bourcier, Romain Bo...
ATAL
2006
Springer
14 years 13 days ago
Structural evaluation of agent organizations
A multi-agent system can be analyzed and specified as an organization consisting of roles and their relations. The performance of an organization depends on many factors among whi...
Davide Grossi, Frank Dignum, Virginia Dignum, Mehd...
SIAMDM
2010
140views more  SIAMDM 2010»
13 years 7 months ago
Retractions to Pseudoforests
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
Tomás Feder, Pavol Hell, Peter Jonsson, And...
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 3 months ago
A Matrix Hyperbolic Cosine Algorithm and Applications
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
Anastasios Zouzias
WWW
2011
ACM
13 years 3 months ago
OntoTrix: a hybrid visualization for populated ontologies
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
Benjamin Bach, Emmanuel Pietriga, Ilaria Liccardi,...