Sciweavers

1651 search results - page 263 / 331
» Measuring the Complexity of Classification Problems
Sort
View
AUTOMATICA
2002
81views more  AUTOMATICA 2002»
13 years 8 months ago
The explicit linear quadratic regulator for constrained systems
For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimi...
Alberto Bemporad, Manfred Morari, Vivek Dua, Efstr...
MP
2002
84views more  MP 2002»
13 years 8 months ago
The volume algorithm revisited: relation with bundle methods
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
Laura Bahiense, Nelson Maculan, Claudia A. Sagasti...
PVLDB
2008
82views more  PVLDB 2008»
13 years 7 months ago
STBenchmark: towards a benchmark for mapping systems
A fundamental problem in information integration is to precisely specify the relationships, called mappings, between schemas. Designing mappings is a time-consuming process. To al...
Bogdan Alexe, Wang Chiew Tan, Yannis Velegrakis
IJAR
2010
91views more  IJAR 2010»
13 years 6 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
INFOCOM
2010
IEEE
13 years 6 months ago
Optimal Probing for Unicast Network Delay Tomography
—Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work, we present priority probing, an optimal probing schem...
Yu Gu, Guofei Jiang, Vishal Singh, Yueping Zhang