874 search results - page 63 / 175 » Computing Weighted Solutions in Answer Set Programming |
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
WMPI
2004
ACM
15 years 6 months ago
2004
ACM
During a program’s runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decomp...
192
click to vote
POPL
2008
ACM
16 years 1 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
138
Voted
MICRO
1997
IEEE
15 years 5 months ago
1997
IEEE
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
MP
2002
15 years 13 days ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...