Sciweavers

12052 search results - page 2167 / 2411
» computer 2010
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 3 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 3 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 3 months ago
Initialization parameter sweep in ATHENA: optimizing neural networks for detecting gene-gene interactions in the presence of sma
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...
Emily Rose Holzinger, Carrie C. Buchanan, Scott M....
GECCO
2010
Springer
230views Optimization» more  GECCO 2010»
14 years 3 months ago
Exponential natural evolution strategies
The family of natural evolution strategies (NES) offers a principled approach to real-valued evolutionary optimization by following the natural gradient of the expected fitness....
Tobias Glasmachers, Tom Schaul, Yi Sun, Daan Wiers...
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 3 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
« Prev « First page 2167 / 2411 Last » Next »