1695 search results - page 135 / 339 » Linear, Polynomial or Exponential |
140
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
138
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
123
click to vote
STACS
1989
Springer
15 years 8 months ago
1989
Springer
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
130
Voted
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...
133
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...