Sciweavers

Share
IS
2011
9 years 5 months ago
Time prediction based on process mining
Abstract. Process mining allows for the automated discovery of process models from event logs. These models provide insights and enable various types of model-based analysis. This ...
Wil M. P. van der Aalst, M. H. Schonenberg, Minseo...
HCI
2009
9 years 8 months ago
Gesture-Controlled User Input to Complete Questionnaires on Wrist-Worn Watches
The aim of this work was to investigate arm gestures as an alternative input modality for wrist-worn watches. In particular we implemented a gesture recognition system and question...
Oliver Amft, Roman Amstutz, Asim Smailagic, Daniel...
JSAC
2010
142views more  JSAC 2010»
9 years 8 months ago
Extreme value FEC for reliable broadcasting in wireless networks
—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting in loss-...
Weiyao Xiao, David Starobinski
JCO
2007
100views more  JCO 2007»
9 years 10 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye
ESA
2008
Springer
83views Algorithms» more  ESA 2008»
10 years 6 days ago
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
Samir Khuller, Julián Mestre
LATIN
2010
Springer
10 years 11 days ago
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Eric Angel, Evripidis Bampis, Nicolas Thibault
HIPC
2000
Springer
10 years 2 months ago
Characterization and enhancement of Static Mapping Heuristics for Heterogeneous Systems
Heterogeneous computing environments have become attractive platforms to schedule computationally intensive jobs. We consider the problem of mapping independent tasks onto machines...
Praveen Holenarsipur, Vladimir Yarmolenko, Jos&eac...
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
10 years 2 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
COCOON
2007
Springer
10 years 2 months ago
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
George Christodoulou, Laurent Gourvès, Fann...
CIA
1998
Springer
10 years 2 months ago
Strategies for Querying Information Agents
In a simple cooperative MAS model where a collection of "querying agents" can send queries to a collection of "information agents", we formalize the problem of ...
Prasad Chalasani, Somesh Jha, Onn Shehory, Katia P...
books