#### Filter Results:

- Full text PDF available (37)

#### Publication Year

1974

2017

- This year (8)
- Last 5 years (37)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Robots with lights is a model of autonomous mobile computational entties operating in the plane in Look-Compute-Move cycles: each agent has an externally visible light which can assume colors from a fixed set; the lights are persistent (i.e., the color is not erased at the end of a cycle), but otherwise the agents are oblivious. The investigation of… (More)

Consider a finite set of identical computational entities that can move freely in the Eu-clidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity p at time t; entity p can see entity q at time t if at that time no other entity lies on the line segment p(t)q(t). We consider the basic problem called Mutual Visibility:… (More)

- Giovanni Viglietta
- Theory of Computing Systems
- 2012

We establish some general schemes relating the computational complexity of a video game to the presence of certain common elements or mechanics, such as destroyable paths, collectible items, doors opened by keys or activated by buttons or pressure plates, etc. Then we apply such “metatheorems” to several video games published between 1980 and 1998,… (More)

- Giovanni Viglietta
- ALGOSENSORS
- 2013

We study the rendezvous problem for two robots moving in the plane (or on a line). Robots are autonomous, anonymous, oblivious, and carry colored lights that are visible to both. We consider deter-ministic distributed algorithms in which robots do not use distance information, but try to reduce (or increase) their distance by a constant factor, depending on… (More)

- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
- OPODIS
- 2014

Consider a set of n = 4 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities , no central coordination, no direct communication, no memory of the past, deterministic) initially in distinct locations, moving freely in the plane and able to sense the positions of the other robots. We study the primitive task… (More)

Consider a finite set of identical entities, called robots, which can move freely in the Euclidean plane. Let p(t) denote the location of robot p at time t; a robot p can see robot q at time t if at that time no other robot lies in the line segment p(t)q(t). We consider the basic problem called Mutual Visibility: starting from arbitrary distinct locations,… (More)

- Marcello Mamino, Giovanni Viglietta
- CCCG
- 2016

A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration. In the present paper, we consider robots that operate in the Euclidean plane and are… (More)

- P Pavlica, L Barozzi, G Stasi, G Viglietta
- La Radiologia medica
- 1989

The authors have studied 5 patients with syringocele--or cystic dilatation of the excretory ducts in Cowper's glands--using a 7.5 MHz linear high-definition US probe. The urethra was distended with a saline solution introduced through a small Foley's balloon catheter placed in the navicular fossa. Longitudinal and transverse scans were employed at both the… (More)

The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract We prove NP-hardness results for five of Nintendo's largest video game franchises: Mario, all Legend of Zelda games; all Metroid games; and all Pokémon role-playing games. In addition, we prove PSPACE-completeness of the Donkey… (More)

- Giovanni Viglietta
- FUN
- 2012

Mastermind is a popular board game released in 1971, where a codemaker chooses a secret pattern of colored pegs, and a codebreaker has to guess it in several trials. After each attempt, the codebreaker gets a response from the codemaker containing some information on the number of correctly guessed pegs. The search space is thus reduced at each turn, and… (More)