3238 search results - page 183 / 648 » On the Computational Interpretation of Negation |
154
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
166
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
175
click to vote
IPPS
2008
IEEE
16 years 29 days ago
2008
IEEE
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and netwo...
161
click to vote
IPPS
2007
IEEE
16 years 25 days ago
2007
IEEE
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
158
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
This paper presents a verification technique which is specifically targeted to formally comparing large combinational circuits with some structural similarities. The approach co...