13987 search results - page 772 / 2798 » The Two Guards Problem |
248
click to vote
FPL
2008
Springer
15 years 9 months ago
2008
Springer
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
162
click to vote
CCCG
2007
15 years 9 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
215
click to vote
ICWS
2010
IEEE
15 years 9 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
183
click to vote
NIPS
2007
15 years 9 months ago
2007
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
217
click to vote
STAIRS
2008
15 years 9 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...