Sciweavers

959 search results - page 140 / 192
» Possible and Necessary h-Indices
Sort
View
JGT
2007
68views more  JGT 2007»
13 years 7 months ago
Forcing highly connected subgraphs
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
Maya Jakobine Stein
TROB
2008
105views more  TROB 2008»
13 years 7 months ago
Robot-to-Robot Relative Pose Estimation From Range Measurements
In this paper, we address the problem of determining the 2D relative pose of pairs of communicating robots from (i) robot-to-robot distance measurements and (ii) displacement estim...
Xun S. Zhou, Stergios I. Roumeliotis
AI
2004
Springer
13 years 7 months ago
A unifying semantics for time and events
We give a formal semantics for a highly expressive language for representing temporal relationships and events. This language, which we call Versatile Event Logic (VEL), provides ...
Brandon Bennett, Antony Galton
JSW
2007
119views more  JSW 2007»
13 years 7 months ago
Formalizing Mobility in Service Oriented Computing
— The usual scenario of service oriented systems is characterized by several services offering the same functionalities, by new services that are continuosly deployed and by othe...
Claudio Guidi, Roberto Lucchi
JUCS
2007
110views more  JUCS 2007»
13 years 7 months ago
Self-Evolving Petri Nets
: Nowadays, software evolution is a very hot topic. It is particularly complex when it regards critical and nonstopping systems. Usually, these situations are tackled by hard-codin...
Lorenzo Capra, Walter Cazzola