Sciweavers

551 search results - page 62 / 111
» Formalizing the Logic-Automaton Connection
Sort
View
IV
2008
IEEE
155views Visualization» more  IV 2008»
15 years 4 months ago
Visualise Undrawable Euler Diagrams
Given a group of overlapping sets, it is not always possible to represent it with Euler diagrams. Euler diagram characteristics might collide with the sets relationships to depict...
Paolo Simonetto, David Auber
SCAM
2007
IEEE
15 years 4 months ago
Barrier Slicing for Remote Software Trusting
Remote trusting aims at verifying the “healthy” execution of a program running on an untrusted client that communicates with a trusted server via network connection. After giv...
Mariano Ceccato, Mila Dalla Preda, Jasvir Nagra, C...
CCS
2007
ACM
15 years 4 months ago
Analyzing the vulnerability of superpeer networks against attack
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy ...
SSS
2007
Springer
15 years 3 months ago
Self-stabilization and Virtual Node Layer Emulations
We present formal definitions of stabilization for the Timed I/O Automata (TIOA) framework, and of emulation for the timed Virtual Stationary Automata programming abstraction laye...
Tina Nolte, Nancy A. Lynch
ICRA
2006
IEEE
88views Robotics» more  ICRA 2006»
15 years 3 months ago
A Method of Cooperative Control using Occasional non-local Interactions
— Current approaches to distributed control involving many robots generally restrict interactions to pairs of robots within a threshold distance. While this allows for provable s...
Brian Shucker, Todd D. Murphey, John K. Bennett