Sciweavers

37 search results - page 6 / 8
» Bounded Analysis and Decomposition for Behavioural Descripti...
Sort
View
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 1 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
JCC
2007
162views more  JCC 2007»
13 years 7 months ago
Bond electron pair: Its relevance and analysis from the quantum chemistry point of view
: This paper first comments on the surprisingly poor status that Quantum Chemistry has offered to the fantastic intuition of Lewis concerning the distribution of the electrons in ...
Jean-Paul Malrieu, Nathalie Guihéry, Carmen...
ATAL
2005
Springer
14 years 26 days ago
Matchmaking multi-party interactions using historical performance data
Matchmaking will be an important component of future agent and agent-like systems, such as the semantic web. Most research on matchmaking has been directed toward sophisticated ma...
David Lambert, David Robertson
SIGSOFT
2001
ACM
14 years 8 months ago
Detecting implied scenarios in message sequence chart specifications
Scenario-based specifications such as Message Sequence Charts (MSCs) are becoming increasingly popular as part of a requirements specification. Scenarios describe how system compo...
Jeff Kramer, Jeff Magee, Sebastián Uchitel
SEMWEB
2010
Springer
13 years 5 months ago
OWL-POLAR: Semantic Policies for Agent Reasoning
Abstract. Policies are declarations of constraints on the behaviour of components within distributed systems, and are often used to capture norms within agent-based systems. A few ...
Murat Sensoy, Timothy J. Norman, Wamberto Weber Va...