Sciweavers

1998 search results - page 228 / 400
» Basic Association Rules
Sort
View
120
Voted
DISOPT
2008
85views more  DISOPT 2008»
15 years 2 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci
108
Voted
DKE
2008
72views more  DKE 2008»
15 years 2 months ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon
115
Voted
IANDC
2006
82views more  IANDC 2006»
15 years 2 months ago
Recognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
Achim Blumensath, Bruno Courcelle
137
Voted
IOR
2008
105views more  IOR 2008»
15 years 2 months ago
The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
Grace Y. Lin, Yingdong Lu, David D. Yao
115
Voted
IJHPCN
2006
109views more  IJHPCN 2006»
15 years 2 months ago
Communication issues within high performance computing grids
: This paper presents several ideas pertaining to desirable properties associated with protocols for moving large amounts of data over a grid of high performance computers. The pro...
Robert D. McLeod, Sajid Hussain, Sheng Huang, Mare...