Sciweavers

1094 search results - page 185 / 219
» On Computing Explanations in Argumentation
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
13 years 11 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
AIS
2010
Springer
13 years 10 months ago
Anticipation and the artificial: aesthetics, ethics, and synthetic life
If complexity is a necessary but not sufficient premise for the existence and expression of the living, anticipation is the distinguishing characteristic of what is alive. Anticipa...
Mihai Nadin
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel
The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices a...
Ashish Khisti, Gregory W. Wornell
ECCC
2008
122views more  ECCC 2008»
13 years 10 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
JASIS
2008
77views more  JASIS 2008»
13 years 10 months ago
Citers' use of citees' names: Findings from a qualitative interview-based study
This article focuses on why academic writers in computer science and sociology sometimes supply the reader with more details of citees' names than they need to: why citers na...
Nigel Harwood