Sciweavers

1170 search results - page 227 / 234
» How Fast Is Too Fast
Sort
View
146
Voted
TVLSI
2008
187views more  TVLSI 2008»
15 years 21 days ago
A Design Flow for Architecture Exploration and Implementation of Partially Reconfigurable Processors
During the last years, the growing application complexity, design, and mask costs have compelled embedded system designers to increasingly consider partially reconfigurable applica...
Kingshuk Karuri, Anupam Chattopadhyay, Xiaolin Che...
123
Voted
AI
2002
Springer
15 years 20 days ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
AROBOTS
2002
115views more  AROBOTS 2002»
15 years 20 days ago
Statistical Learning for Humanoid Robots
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
Sethu Vijayakumar, Aaron D'Souza, Tomohiro Shibata...
BMCBI
2004
167views more  BMCBI 2004»
15 years 20 days ago
Feature selection for splice site prediction: A new method using EDA-based feature ranking
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
Yvan Saeys, Sven Degroeve, Dirk Aeyels, Pierre Rou...
AI
2000
Springer
15 years 19 days ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...