Sciweavers

400 search results - page 22 / 80
» What Makes a Problem GP-Hard
Sort
View
AAAI
2004
13 years 10 months ago
Tractable Tree Convex Constraint Networks
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
Yuanlin Zhang, Eugene C. Freuder
LOGCOM
2008
120views more  LOGCOM 2008»
13 years 8 months ago
Reconstructing an Agent's Epistemic State from Observations about its Beliefs and Non-beliefs
We look at the problem in belief revision of trying to make inferences about what an agent believed--or will believe--at a given moment, based on an observation of how the agent h...
Richard Booth, Alexander Nittka
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 3 months ago
On the Zero-Error Capacity Threshold for Deletion Channels
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...
Ian A. Kash, Michael Mitzenmacher, Justin Thaler, ...
ECIS
2004
13 years 10 months ago
Extending media richness theory: the influence of a shared social construction
Globalization has seen the emergence of virtual teams solving complex organisational problems using computer-mediated technologies. By extending Media Richness Theory, it was the ...
Irem Sevinc, John D'Ambra
ACSAC
2009
IEEE
14 years 3 months ago
The Good, the Bad, And the Ugly: Stepping on the Security Scale
: Metrics are both fashionable and timely: many regulations that affect cybersecurity rely upon metrics – albeit, of the checklist variety in many cases – to ascertain complian...
Mary Ann Davidson