Sciweavers

3082 search results - page 293 / 617
» New Bounds for the Controller Problem
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
15 years 1 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
CORR
2009
Springer
99views Education» more  CORR 2009»
15 years 4 months ago
Quotient Complexity of Regular Languages
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
Janusz A. Brzozowski
ICALP
2009
Springer
16 years 7 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 25 days ago
Self-adaptive ant colony optimisation applied to function allocation in vehicle networks
Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
Manuel Förster, Bettina Bickel, Bernd Hardung...
AIPS
2007
15 years 9 months ago
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
Raghav Aras, Alain Dutech, François Charpil...