This paper presents the Expected Solution Quality (ESQ) method for statistically characterizing scheduling problems and the performance of schedulers The ESQ method is demonstrated by applying it to a practical telescope scheduling problem The method addresses the important and difficult issue of how to meaningfully evaluate the performance of a scheduler on a constrained optimization problem f...

The "Teachable Letter Recognizer" (TLR) is a program for letter learning which uses a method not vet described in the character recognition literature. TLR has two main characteristics: (1) It uses a discrimination tree as a knowledge representation. The discrimination tree is a quadtree w i t h some additions. (2) The two types of global features that are used to characterise a letter are the ...

AlxwaciThis contribution introduces instrumental speech quality measures for the GSM system based only on transmission parameters. Certain combinations of CSM parameters which quantify the transmission quality in terms of bit error rate, received power level, etc., were shown be suitable for the prediction of the resulting speech quality. Neither the original nor the received speech signal is n...

W e present a new distributed algorithm that detects and resolves communication deadlocks on-line, i .e . , simultaneously detects and resolves deadlock as communication requests are made, at no additional message t r a f i c overhead, and with bounded delay between the occurrence and detection of a deadlock. This i s achieved via a novel technique for detecting knots, which suf ice for the exi...

Text classification, the grouping of texts into several clusters, has been used as a means of improving both the efficiency and the effectiveDess of text retrieval/categorization In this paper we propose a hierarchical clustering algor i thm that constructs a Bet of clusters having the maximum Bayesian posterior probability, the probability that the given texts are classified into clusters We c...

An improved stochastic stereo-matching algorithm is presented. It incorporates two substantial modifications to an earlier version: a new variation of simulated annealing that is faster, simpler, and more controllable than the conventional "heatbath^ version, and a hierarchical, coarse-to-fine-resolution cont ro l structure. The Hamil tonian used in the original model is minimized, but far more...

Presented is the design of a flexible expandable multiprocessor system for video graphics and image processing. The design involves a central controller wh ich broadcasts data to a variable number of independently executing processing units, each of which in turn controls a vari able number of memo ry units among whi ch the video (frame buffer) image is distributed. An interl eaved addressing o...

We investigate the problem of learning D N F concepts f rom examples using decision trees as a concept description language. Due to the replication problem, D N F concepts do not always have a concise decision tree descrip­ tion when the tests at the nodes are l im­ ited to the in i t ia l at t r ibutes. However, the representational complexity may be overcome by using high level at tr ibutes a...

The incidence coloring conjecture, proposed by Brualdi and Massey in 1993, states that the incidence coloring number of every graph is at most ∆ + 2, where ∆ is the maximum degree of a graph. The conjecture was shown to be false in general by Guiduli in 1997, following the work of Algor and Alon. However, in 2005 Maydanskiy proved that the conjecture holds for any graph with ∆ ≤ 3. It is easily...