Sciweavers

654 search results - page 87 / 131
» Ordered Sets and Complete Lattices
Sort
View
ALT
2001
Springer
14 years 4 months ago
Learning How to Separate
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
Sanjay Jain, Frank Stephan
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 12 hour ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
VISSYM
2007
13 years 10 months ago
Relevance Driven Visualization of Financial Performance Measures
Visual data analysis has received a lot of research interest in recent years, and a wide variety of new visualization techniques and applications have been developed to improve in...
Hartmut Ziegler, Tilo Nietzschmann, Daniel A. Keim
IOR
2002
135views more  IOR 2002»
13 years 7 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
ACMICEC
2007
ACM
201views ECommerce» more  ACMICEC 2007»
13 years 11 months ago
Bid based scheduler with backfilling for a multiprocessor system
We consider a virtual computing environment that provides computational resources on demand to users with multiattribute task descriptions that include a valuation, resource (CPU)...
Inbal Yahav, Louiqa Raschid, Henrique Andrade