10848 search results - page 1975 / 2170 » Programming in Biomolecular Computation |
188
click to vote
COLOGNETWENTE
2010
15 years 3 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
192
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
175
click to vote
CIM
2011
15 years 1 months ago
2011
We propose to return to the roots of Artificial/Computational Intelligence applicability to board games domain by attempting to mimic human way of playing (or human intelligence ...
214
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
212
click to vote
CSCW
2011
ACM
15 years 1 months ago
2011
ACM
Computer users rely on software tools to work effectively and efficiently, but it is difficult for users to be aware of all the tools that might be useful to them. While there a...