3020 search results - page 550 / 604 » Optimal partition trees |
146
click to vote
ICSM
2002
IEEE
15 years 9 months ago
2002
IEEE
Over the past years it has become evident that the benefits of object orientation warrant the design and development of reengineering methods that aim to migrate legacy procedural...
150
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
143
click to vote
HIPEAC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
139
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
139
Voted
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper we extend a previously introduced method for optimizing the arbitration policy employed by ServerNet routers and we evaluate the method's effect on scalability....