Sciweavers

2479 search results - page 186 / 496
» Quantum complexity theory
Sort
View
IJCAI
1997
15 years 8 months ago
An Aggregation Procedure for Building Episodic Memory
When dealing with narrative texts, a system must possess a strong domain theory, and especially knowledge about situations occurring in the world. Otherwise the system must envisa...
Olivier Ferret, Brigitte Grau
CSL
2010
Springer
15 years 7 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
COMPGEOM
2004
ACM
16 years 6 days ago
The geometric thickness of low degree graphs
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
Christian A. Duncan, David Eppstein, Stephen G. Ko...
MFCS
2004
Springer
16 years 4 days ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier