7197 search results - page 1212 / 1440 » On the computational power of BlenX |
192
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
176
click to vote
PFE
2001
Springer
15 years 11 months ago
2001
Springer
Although software mass customization offers the potential for order-of-magnitude improvements in software engineering performance, the up-front cost, level of effort, assumed risk,...
201
click to vote
EH
1999
IEEE
15 years 11 months ago
1999
IEEE
We address the fundamental issue of fully automated design (FAD) and construction of inexpensive robots and their controllers. Rather than seek an intelligent general purpose robo...
324
click to vote
MAM
2011
15 years 1 months ago
2011
The paper presents a new multiplier enabling achievement of an arbitrary accuracy. It follows the same idea of number representation as the Mitchell’s algorithm, but does not use...
198
click to vote
MONET
2011
15 years 1 months ago
2011
Critical Infrastructures (CIs) such as the Power Grid play an important role in our lives. Of all important aspects of CIs, real-time data delivery is the most important one becaus...