Sciweavers

949 search results - page 73 / 190
» Theory of Constraints
Sort
View
90
Voted
TSP
2008
114views more  TSP 2008»
15 years 17 days ago
Zero-Forcing Precoding and Generalized Inverses
Abstract--We consider the problem of linear zero-forcing precoding design and discuss its relation to the theory of generalized inverses in linear algebra. Special attention is giv...
Ami Wiesel, Yonina C. Eldar, Shlomo Shamai
127
Voted
AR
2007
138views more  AR 2007»
15 years 25 days ago
Integrating robotics and neuroscience: brains for robots, bodies for brains
—Researchers in robotics and artificial intelligence have often looked at biology as a source of inspiration for solving their problems. From the opposite perspective, neuroscie...
Michele Rucci, Daniel Bullock, Fabrizio Santini
LPAR
2005
Springer
15 years 6 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
PADL
2010
Springer
15 years 9 months ago
Automating Mathematical Program Transformations
Abstract. Mathematical programs (MPs) are a class of constrained optimization problems that include linear, mixed-integer, and disjunctive programs. Strategies for solving MPs rely...
Ashish Agarwal, Sooraj Bhat, Alexander Gray, Ignac...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 4 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller