Sciweavers

1007 search results - page 56 / 202
» The Complexity of Futile Questioning
Sort
View
142
Voted
AAAI
2008
15 years 6 months ago
Measuring the Hardness of SAT Instances
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
TPDS
2008
76views more  TPDS 2008»
15 years 3 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 4 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
117
Voted
AGILEDC
2008
IEEE
15 years 10 months ago
The Intermediate Customer Anti-Pattern
Scrum focuses on collaboration with the customer, but what if your customer is actually a provider for yet another customer? Then who is your real customer? What if these two poss...
Tom Perry
NIME
2004
Springer
102views Music» more  NIME 2004»
15 years 9 months ago
Gesture and Musical Interaction: Interactive Engagement Through Dynamic Morphology
New Interfaces for Musical Expression must speak to the nature of ‘instrument’, that is, it must always be understood that the interface binds to a complex musical phenomenon....
Garth Paine