Sciweavers

11051 search results - page 374 / 2211
» An Investigation of Generalized Cases
Sort
View
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
13 years 10 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu
SDM
2012
SIAM
340views Data Mining» more  SDM 2012»
13 years 10 months ago
IntruMine: Mining Intruders in Untrustworthy Data of Cyber-physical Systems
A Cyber-Physical System (CPS) integrates physical (i.e., sensor) devices with cyber (i.e., informational) components to form a situation-aware system that responds intelligently t...
Lu An Tang, Quanquan Gu, Xiao Yu, Jiawei Han, Thom...
INFOCOM
2002
IEEE
16 years 16 days ago
Real-time Model and Convergence Time of BGP
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...
Davor Obradovic
ICALT
2009
IEEE
15 years 5 months ago
Applying Learning Styles to SCORM Compliant Courses
This paper proposes a general framework to develop SCORM compliant courses that provide adaptation according to user learning style. The SCORM standard as well as some of the most...
Ioannis Kazanidis, Maya Satratzemi
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 7 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee