3946 search results - page 673 / 790 » The computational complexity of choice sets |
155
click to vote
ASPLOS
2008
ACM
15 years 8 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
238
click to vote
AUSDM
2008
Springer
15 years 8 months ago
2008
Springer
Malware detection is an important problem today. New malware appears every day and in order to be able to detect it, it is important to recognize families of existing malware. Dat...
182
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
— Architecture Description Languages (ADLs) are widely used to perform design space exploration for Application Specific Instruction Set Processors (ASIPs). While the design spa...
151
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
180
click to vote
AAAI
2010
15 years 8 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...