3113 search results - page 297 / 623 » Efficiently Generating Efficient Generating Extensions in Pr... |
211
click to vote
SSD
2007
Springer
15 years 10 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
141
click to vote
CAISE
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Specification of systems in a software product line (product-line members) is often supported by domain-specific languages (DSLs) that provide pownguage abstractions for ...
187
click to vote
DATE
1999
IEEE
15 years 9 months ago
1999
IEEE
Dynamically reconfigurable embedded systems offer potential for higher performance as well as adaptability to changing system requirements at low cost. Such systems employ run-tim...
140
click to vote
RTSS
1998
IEEE
15 years 9 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
177
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
The inherent reconfigurability of SRAM-based FPGAs enables the use of configurations optimized for the problem at hand. Optimized configurations are smaller and faster than their g...