Sciweavers

2503 search results - page 484 / 501
» A study of 3-arc graphs
Sort
View
AAAI
2010
13 years 9 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer
GECCO
2008
Springer
107views Optimization» more  GECCO 2008»
13 years 8 months ago
The influence of scaling and assortativity on takeover times in scale-free topologies
In evolving systems, the topological characteristics of population structure have a pronounced impact on the rate of spread of advantageous alleles, and therefore affect selective...
Joshua L. Payne, Margaret J. Eppstein
AML
2007
68views more  AML 2007»
13 years 7 months ago
A note on weak dividing
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...
Byunghan Kim, Niandong Shi
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments
Background: High-throughput methods that allow for measuring the expression of thousands of genes or proteins simultaneously have opened new avenues for studying biochemical proce...
Andreas Keller, Christina Backes, Maher Al-Awadhi,...
COR
2010
123views more  COR 2010»
13 years 7 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...