1263 search results - page 34 / 253 » A* with Bounded Costs |
ICNP
2003
IEEE
15 years 3 months ago
2003
IEEE
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
ICNP
1998
IEEE
15 years 1 months ago
1998
IEEE
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
EOR
2006
14 years 9 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
116
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Active learning strategies can be useful when manual labeling
effort is scarce, as they select the most informative
examples to be annotated first. However, for visual category
...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...