5606 search results - page 747 / 1122 » Randomization Techniques for Graphs. |
145
click to vote
ICRA
2003
IEEE
16 years 3 days ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
179
Voted
WSE
2003
IEEE
16 years 2 days ago
2003
IEEE
Reverse engineering techniques have the potential to support Web site understanding, by providing views that show the organization of a site and its navigational structure. Howeve...
195
click to vote
SOFTVIS
2003
ACM
16 years 1 days ago
2003
ACM
An active research area in telecommunications concerns how to specify and control the addition of new services, such as call waiting or instant messaging, into existing software. ...
179
click to vote
SPAA
2003
ACM
16 years 1 days ago
2003
ACM
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
181
Voted
ADBIS
2003
Springer
16 years 1 days ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...