84
Voted
TCS
2010
14 years 11 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...
94
Voted
TCS
2010
14 years 11 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...
57
Voted
TCS
2010
14 years 11 months ago
2010
53
Voted
TCS
2010
14 years 11 months ago
2010
113
click to vote
TCS
2010
14 years 11 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...
104
Voted
TCS
2010
14 years 11 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...
95
Voted
TCS
2010
14 years 11 months ago
2010
We define a subclass of timed automata, called oscillator timed automata, suitable to model biological oscillators. Coupled biological oscillators may synchronise, as emerging be...
97
Voted
TCS
2010
14 years 11 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
74
Voted
TCS
2010
14 years 11 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
59
Voted
TCS
2010
14 years 11 months ago
2010