280 search results - page 50 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
BMCBI
2006
13 years 7 months ago
2006
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
When software developers want to understand the reason for a program's behavior, they must translate their questions about the behavior into a series of questions about code,...
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Distributed local memories, or scratchpads, have been shown to effectively reduce cost and power consumption of application-specific accelerators while maintaining performance. Th...
CONCUR
2008
Springer
13 years 9 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...