Sciweavers

82 search results - page 15 / 17
» No four subsets forming an N
Sort
View
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 7 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
13 years 11 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
Lila Kari, Benoît Masson
ISVLSI
2002
IEEE
109views VLSI» more  ISVLSI 2002»
14 years 14 days ago
A Network on Chip Architecture and Design Methodology
We propose a packet switched platform for single chip systems which scales well to an arbitrary number of processor like resources. The platform, which we call Network-on-Chip (NO...
Shashi Kumar, Axel Jantsch, Mikael Millberg, Johnn...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 23 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen