834 search results - page 150 / 167 » Computing Minimal Models, Stable Models, and Answer Sets |
STOC
2009
ACM
16 years 11 days ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
103
click to vote
KDD
2003
ACM
16 years 4 days ago
2003
ACM
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...
ICCAD
2005
IEEE
15 years 8 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
100
click to vote
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...