2656 search results - page 124 / 532 » Design and analysis of algorithms reconsidered |
185
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
161
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
eriodically time-varying (LPTV) abstractions are useful for a variety of communication and computer subsystems. In this paper, we present a novel operator-based model-order reduct...
189
click to vote
APPT
2007
Springer
15 years 8 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
174
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper proposes a novel methodology tailored to design embedded systems, taking into account the emerging market needs, such as hw/sw partitioning, object-oriented specificati...