1232 search results - page 96 / 247 » Digraphs: theory, algorithms and applications |
159
Voted
TOPLAS
2010
15 years 4 months ago
2010
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
176
click to vote
IWOCA
2010
Springer
15 years 29 days ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
138
click to vote
SIGECOM
2009
ACM
16 years 20 days ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
162
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
167
Voted
ISSAC
2009
Springer
16 years 21 days ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...