1930 search results - page 374 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
TITS
2011
13 years 3 months ago
2011
Abstract—Over the last few years, electronic vehicle guidance systems have become increasingly more popular. However, despite their ubiquity, performance will always be subject t...
CCO
2001
Springer
14 years 29 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
OOPSLA
2010
Springer
13 years 6 months ago
2010
Springer
Programming forums are becoming the primary tools for programmers to find answers for their programming problems. Our empirical study of popular programming forums shows that the...
SSDBM
2008
IEEE
14 years 2 months ago
2008
IEEE
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that...