Sciweavers

217 search results - page 25 / 44
» Quantifying group problem solving with stochastic analysis
Sort
View
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
14 years 2 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 1 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
TON
2010
147views more  TON 2010»
13 years 6 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
GECCO
2010
Springer
183views Optimization» more  GECCO 2010»
14 years 16 days ago
Neuroevolution of mobile ad hoc networks
This paper describes a study of the evolution of distributed behavior, specifically the control of agents in a mobile ad hoc network, using neuroevolution. In neuroevolution, a p...
David B. Knoester, Heather Goldsby, Philip K. McKi...
BMCBI
2008
102views more  BMCBI 2008»
13 years 7 months ago
Significance analysis of microarray for relative quantitation of LC/MS data in proteomics
Background: Although fold change is a commonly used criterion in quantitative proteomics for differentiating regulated proteins, it does not provide an estimation of false positiv...
Bryan A. P. Roxas, Qingbo Li