3471 search results - page 556 / 695 » Obstacle Numbers of Graphs |
175
Voted
EMSOFT
2010
Springer
15 years 4 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
165
click to vote
CASES
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
161
click to vote
ICMCS
2009
IEEE
15 years 3 months ago
2009
IEEE
Parallel scalability allows an application to efficiently utilize an increasing number of processing elements. In this paper we explore a design space for parallel scalability for...
158
click to vote
IJRR
2010
15 years 3 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
245
Voted
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Social network services have become a viable source of information for users. In Twitter, information deemed important by the community propagates through retweets. Studying the c...