Sciweavers

1917 search results - page 373 / 384
» Experimenting with Nonmonotonic Reasoning
Sort
View
CN
2010
149views more  CN 2010»
13 years 7 months ago
A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
In the current Internet picture more than 70% of the hosts are located behind Network Address Translators (NATs). This is not a problem in the client/server paradigm. However, the...
Rubén Cuevas Rumín, Ángel Cue...
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 7 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 7 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
BMCBI
2006
146views more  BMCBI 2006»
13 years 7 months ago
Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training
Background: Particle Swarm Optimization (PSO) is an established method for parameter optimization. It represents a population-based adaptive optimization technique that is influen...
Michael Meissner, Michael Schmuker, Gisbert Schnei...