431 search results - page 12 / 87 » We have always been transgenic |
SAGT
2010
Springer
13 years 7 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Measurement of available bandwidth in a network has always been a topic of great interest. This knowledge can be applied to a wide variety of applications and can be instrumenta...
OOPSLA
2004
Springer
14 years 2 months ago
2004
Springer
Many techniques have been developed over the years to automatically find bugs in software. Often, these techniques rely on formal methods and sophisticated program analysis. Whil...
JUCS
2002
13 years 8 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
COMGEO
2011
ACM
13 years 3 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...