Sciweavers

3038 search results - page 42 / 608
» Controlling Engineering Problem Solving
Sort
View
JAL
2008
74views more  JAL 2008»
13 years 9 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
JOTA
2010
127views more  JOTA 2010»
13 years 3 months ago
Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...
Henri Bonnel, C. Yalçin Kaya
AMAI
2000
Springer
14 years 19 days ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
14 years 3 months ago
Mobile robot control in the road sign problem using Reservoir Computing networks
— In this work we tackle the road sign problem with Reservoir Computing (RC) networks. The T-maze task (a particular form of the road sign problem) consists of a robot in a T-sha...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
CORR
2004
Springer
121views Education» more  CORR 2004»
13 years 8 months ago
Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
Erik G. Boman, Bruce Hendrickson, Stephen A. Vavas...