Sciweavers

895 search results - page 125 / 179
» Using graphs for some discrete tomography problems
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
15 years 7 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
SIMULATION
1998
177views more  SIMULATION 1998»
14 years 9 months ago
Simulation and Planning of an Intermodal Container Terminal
A decision support system for the management of an intermodal container terminal is presented. Among the problems to be solved, there are the spatial allocation of containers on t...
Luca Maria Gambardella, Andrea Emilio Rizzoli, Mar...
COCOON
2011
Springer
13 years 9 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
COMPGEOM
2009
ACM
15 years 4 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
CPAIOR
2009
Springer
15 years 4 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin