Sciweavers

18306 search results - page 107 / 3662
» Algorithmics in Exponential Time
Sort
View
EWRL
2008
14 years 11 months ago
Optimistic Planning of Deterministic Systems
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
Jean-François Hren, Rémi Munos
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 11 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
MFCS
2005
Springer
15 years 3 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
DAC
2004
ACM
15 years 3 months ago
Hierarchical approach to exact symbolic analysis of large analog circuits
—This paper proposes a novel approach to the exact symbolic analysis of very large analog circuits. The new method is based on determinant decision diagrams (DDDs) representing s...
Sheldon X.-D. Tan, Weikun Guo, Zhenyu Qi
HYBRID
2010
Springer
15 years 3 months ago
A generating function approach to the stability of discrete-time switched linear systems
Exponential stability of switched linear systems under both arbitrary and proper switching is studied through two suitably defined families of functions called the strong and the...
Jianghai Hu, Jinglai Shen, Wei Zhang