TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
TCS
2010
13 years 10 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
TCS
2010
13 years 10 months ago
2010
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
TCS
2010
13 years 10 months ago
2010
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model co...
TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
TCS
2010
13 years 10 months ago
2010
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...