5595 search results - page 163 / 1119 » Comparing Subsumption Optimizations |
164
Voted
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
We investigate the class of single-round, sealed-bid auctions for a set of identical items in unlimited supply. We adopt the worst-case competitive framework defined by [8, 4] th...
134
Voted
ICDE
2000
IEEE
15 years 9 months ago
2000
IEEE
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
137
click to vote
SCALESPACE
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Multiresolution techniques are often used to shorten the execution times of dynamic programming based deformable contour optimization methods by decreasing the image reso...
151
Voted
JCST
2008
15 years 5 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
168
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...