99 search results - page 8 / 20 » Single-Pass List Partitioning |
163
Voted
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
174
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
180
click to vote
SPIRE
2009
Springer
16 years 11 days ago
2009
Springer
Abstract. Term-partitioned indexes are generally inefficient for the evaluation of conjunctive queries, as they require the communication of long posting lists. On the other side, ...
164
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
143
click to vote
AI
2008
Springer
16 years 6 days ago
2008
Springer
Abstract. In the context of the RoboCup Simulation League, we describe a new representation of a software agent’s visual perception (“scene”), well suited for case-based reas...