Sciweavers

503 search results - page 14 / 101
» An Independence Relation for Sets of Secrets
Sort
View
SLOGICA
2010
138views more  SLOGICA 2010»
13 years 6 months ago
Extensionality and Restriction in Naive Set Theory
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
Zach Weber
HCI
2007
13 years 10 months ago
Serial Hanging Out: Rapid Ethnographic Needs Assessment in Rural Settings
This paper presents an ethnographic method for assessing user needs in designing for rural settings. “Serial Hanging Out” consists of short-term participant observation with mu...
Jaspal S. Sandhu, P. Altankhuyag, D. Amarsaikhan
AML
2006
83views more  AML 2006»
13 years 8 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
TCS
2008
13 years 8 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
TROB
2008
121views more  TROB 2008»
13 years 8 months ago
A Relational Positioning Methodology for Robot Task Specification and Execution
Abstract--This paper presents a relational positioning methodology that allows to restrict totally or partially the movements of an object by specifying its allowed positions in te...
Adolfo Rodriguez, Luis Basañez, Enric Celay...