Sciweavers

90 search results - page 2 / 18
» Interactive Submodular Set Cover
Sort
View
MP
1998
105views more  MP 1998»
13 years 5 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
HRI
2010
ACM
13 years 11 months ago
Judging a bot by its cover: an experiment on expectation setting for personal robots
—Managing user expectations of personal robots becomes particularly challenging when the end-user just wants to know what the robot can do, and neither understands nor cares abou...
Steffi Paepcke, Leila Takayama
MOR
2008
169views more  MOR 2008»
13 years 5 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 2 days ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
ICTAC
2004
Springer
13 years 10 months ago
Minimal Spanning Set for Coverage Testing of Interactive Systems
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
Fevzi Belli, Christof J. Budnik