2681 search results - page 376 / 537 » Problem F |
91
Voted
OOPSLA
2009
Springer
15 years 9 months ago
2009
Springer
Generic classes can be used to improve performance by allowing compile-time polymorphism. But the applicability of compile-time polymorphism is narrower than that of runtime polym...
125
click to vote
PPDP
2009
Springer
15 years 9 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
99
Voted
ASPDAC
2009
ACM
15 years 9 months ago
2009
ACM
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
103
Voted
DOCENG
2009
ACM
15 years 9 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
135
Voted
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...