7943 search results - page 1282 / 1589 » A calculus for costed computations |
231
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
187
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...
174
click to vote
ASSETS
2008
ACM
15 years 8 months ago
2008
ACM
The Flote is a wind instrument designed for people with limited mobility. Past work in this area has failed to deliver the musical expressiveness expected of an instrument while m...
189
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
192
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...