357 search results - page 46 / 72 » Algorithms for the coalitional manipulation problem |
95
Voted
DNA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The emerging field of synthetic biology moves beyond conventional genetic manipulation to construct novel life forms which do not originate in nature. We explore the pro...
GD
2005
Springer
15 years 5 months ago
2005
Springer
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
96
Voted
ITICSE
2010
ACM
15 years 2 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
SPAA
2006
ACM
15 years 6 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...