Sciweavers

303 search results - page 10 / 61
» Link-Time Improvement of Scheme Programs
Sort
View
FSTTCS
2004
Springer
14 years 1 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
PLDI
2010
ACM
14 years 22 days ago
Software data spreading: leveraging distributed caches to improve single thread performance
Single thread performance remains an important consideration even for multicore, multiprocessor systems. As a result, techniques for improving single thread performance using mult...
Md Kamruzzaman, Steven Swanson, Dean M. Tullsen
ICLP
1997
Springer
13 years 11 months ago
Solving Small TSPs with Constraints
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
Yves Caseau, François Laburthe
AIR
2005
99views more  AIR 2005»
13 years 7 months ago
Evolving General Term-Weighting Schemes for Information Retrieval: Tests on Larger Collections
Term-weighting schemes are vital to the performance of Information Retrieval models that use term frequency characteristics to determine the relevance of a document. The vector spa...
Ronan Cummins, Colm O'Riordan
ICPP
2008
IEEE
14 years 2 months ago
Memory Access Scheduling Schemes for Systems with Multi-Core Processors
On systems with multi-core processors, the memory access scheduling scheme plays an important role not only in utilizing the limited memory bandwidth but also in balancing the pro...
Hongzhong Zheng, Jiang Lin, Zhao Zhang, Zhichun Zh...