5506 search results - page 586 / 1102 » Minimal Logic Programs |
173
click to vote
ASPLOS
2006
ACM
15 years 10 months ago
2006
ACM
We report our experience in implementing type and memory safety in an efficient manner for sensor network nodes running TinyOS: tiny embedded systems running legacy, C-like code. ...
197
click to vote
CASES
2001
ACM
15 years 10 months ago
2001
ACM
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
194
click to vote
IJCAI
1989
15 years 8 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
208
click to vote
MICS
2008
15 years 5 months ago
2008
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
229
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...