2635 search results - page 81 / 527 » Algorithms for the Database Layout Problem |
127
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
154
click to vote
IV
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
140
click to vote
EEMMAS
2007
Springer
15 years 10 months ago
2007
Springer
Behind the curtains at check-in desks in airports hide some of the most complex material handling systems, which manage to get your bag transported to the correct departure gate of...
115
click to vote
WSC
2004
15 years 5 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
122
click to vote
CCGRID
2010
IEEE
15 years 5 months ago
2010
IEEE
Finite difference methods continue to provide an important and parallelisable approach to many numerical simulations problems. Iterative multigrid and multilevel algorithms can co...