108 search results - page 17 / 22 » On the computational complexity of partial covers of Theta g... |
SOCA
2008
IEEE
13 years 7 months ago
2008
IEEE
There is no doubt that SOA and BPM will continue to evolve dependently for the next ten years. Preparing common research infrastructures will require most important efforts of web ...
COMGEO
2012
ACM
12 years 3 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
AI
2011
Springer
13 years 2 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
IEEEPACT
2008
IEEE
14 years 2 months ago
2008
IEEE
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...