3934 search results - page 249 / 787 » Approximate Schedulability Analysis |
200
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
151
click to vote
AIPS
2008
15 years 9 months ago
2008
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
137
click to vote
ACL
2008
2008
Simulating the Behaviour of Older versus Younger Users when Interacting with Spoken Dialogue Systems
15 years 8 months ago
In this paper we build user simulations of older and younger adults using a corpus of interactions with a Wizard-of-Oz appointment scheduling system. We measure the quality of the...
172
click to vote
IJCAI
1989
15 years 7 months ago
1989
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, an...
167
click to vote
VTC
2008
IEEE
16 years 28 days ago
2008
IEEE
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...