3082 search results - page 92 / 617 » New Bounds for the Controller Problem |
119
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
149
click to vote
STOC
1995
ACM
15 years 7 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
171
click to vote
FOSSACS
2008
Springer
15 years 5 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
130
click to vote
MP
2006
15 years 4 months ago
2006
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
172
click to vote
SPAA
1994
ACM
15 years 8 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...