687 search results - page 94 / 138 » On The Complexity of Manipulating Elections |
CPM
2010
Springer
14 years 27 days ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
ICALP
2010
Springer
14 years 27 days ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
GIS
2009
ACM
14 years 21 days ago
2009
ACM
Data warehouses and On-Line Analytical Processing (OLAP) provide an analysis framework supporting the decision making process. In many application domains, complex analysis tasks ...
RE
2001
Springer
14 years 16 days ago
2001
Springer
A domain model describes common and variant requirements for a system family. UML notations used in requirements analysis and software modeling can be extended with “variation p...
INFOCOM
2000
IEEE
14 years 14 days ago
2000
IEEE
Abstract—In this paper, we describe a receiver based congestion control policy that leverages TCP flow control mechanisms to prioritize mixed traffic loads across access links....