Sciweavers

1857 search results - page 138 / 372
» Minimum Degree Orderings
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 8 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
DCC
2004
IEEE
16 years 6 months ago
Coding for Fast Access to Image Regions Defined by Pixel Range
Many technical imaging applications, like coding "images" of digital elevation maps, require extracting regions of compressed images in which the pixel values are within...
Amir Said, Sehoon Yea, William A. Pearlman
CP
2004
Springer
15 years 12 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
ATAL
2004
Springer
15 years 12 months ago
Multi-Agent Simulation of Collaborative Strategies in a Supply Chain
The bullwhip effect is the amplification of the order variability in a supply chain. This phenomenon causes important financial cost due to higher inventory levels and agility r...
Thierry Moyaux, Brahim Chaib-draa, Sophie D'Amours
JCT
1998
99views more  JCT 1998»
15 years 6 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu