Sciweavers

277 search results - page 47 / 56
» Using minimum description length for process mining
Sort
View
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
14 years 3 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
TCOM
2008
68views more  TCOM 2008»
13 years 8 months ago
Analysis and design of book-ahead bandwidth-sharing mechanisms
In this article, we present a novel discrete-time Markov chain model of book-ahead bandwidthsharing mechanisms. We use this analytical model and a simulation model to understand t...
Xiangfei Zhu, Malathi Veeraraghavan
AIA
2006
13 years 10 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann
3DIM
2005
IEEE
14 years 2 months ago
Semi-Automatic Range to Range Registration: A Feature-Based Method
Our goal is the production of highly accurate photorealistic descriptions of the 3D world with a minimum of human interaction and increased computational efficiency. Our input is...
Chen Chao, Ioannis Chao
UAI
1996
13 years 10 months ago
Critical Remarks on Single Link Search in Learning Belief Networks
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...
Yang Xiang, S. K. Michael Wong, Nick Cercone