4860 search results - page 16 / 972 » SNPs Problems, Complexity, and Algorithms |
157
Voted
IJCGA
2010
15 years 2 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
129
Voted
AAAI
2000
15 years 5 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
134
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
153
Voted
CIAC
2010
Springer
15 years 12 days ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
160
Voted
FAW
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...