1356 search results - page 9 / 272 » Some New Results on Inverse Sorting Problems |
POPL
2003
ACM
14 years 7 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
COMPGEOM
2004
ACM
14 years 27 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
PPSC
1997
13 years 8 months ago
1997
We present new implementations and results for the NAS Parallel Benchmarks 2 suite. The suite currently consists of seven programs. Of these LU, SP, BT, MG and FT have previously ...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...