15485 search results - page 375 / 3097 » Computing Optimal Subsets |
148
click to vote
APL
1998
ACM
15 years 11 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
156
click to vote
ARC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
183
click to vote
IWEC
2010
15 years 8 months ago
2010
In many computer games narrative is a core component with the game centering on an unfolding, interactive storyline which both motivates and is driven by the game-play. Analyzing n...
156
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
163
click to vote
BILDMED
2009
15 years 7 months ago
2009
Coronary artery bypass grafting (CABG) is the standard treatment for advanced coronary artery diseases (CAD). Optimal placement of the bypass graft on the diseased vessel is very i...