169 search results - page 26 / 34 » Efficient search space exploration for HW-SW partitioning |
166
click to vote
SIGCOMM
2009
ACM
15 years 8 months ago
2009
ACM
So far, the search for Opportunistic Network (ON) applications has focused on urban/rural scenarios where the combined use of mobility and the store-carry-and-forward paradigm hel...
107
Voted
CEC
2005
IEEE
15 years 7 months ago
2005
IEEE
In previous work, we have proposed a novel approach to data clustering based on the explicit optimization of a partitioning with respect to two complementary clustering objectives ...
VIS
2005
IEEE
16 years 3 months ago
2005
IEEE
In a visualization of a three-dimensional dataset, the insights gained are dependent on what is occluded and what is not. Suggestion of interesting viewpoints can improve both the...
93
Voted
ISCAS
2005
IEEE
15 years 7 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
118
click to vote
AI
2004
Springer
15 years 7 months ago
2004
Springer
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...