1508 search results - page 122 / 302 » Efficient Path Profiling |
106
Voted
DAC
1994
ACM
15 years 6 months ago
1994
ACM
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
128
Voted
ICDT
2007
ACM
15 years 6 months ago
2007
ACM
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
138
Voted
FTDCS
2004
IEEE
15 years 6 months ago
2004
IEEE
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
116
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
2010
ACM
It is becoming the norm for small mobile devices to have access to multiple technologies for connecting to the Internet. This gives researchers an increasing interest for solution...
117
Voted
NETWORKS
2008
15 years 2 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...