986 search results - page 96 / 198 » Generalized Goal Programming: polynomial methods and applica... |
IOR
2006
13 years 9 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
BIRTHDAY
2007
Springer
14 years 3 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
ERLANG
2004
ACM
14 years 27 days ago
2004
ACM
This paper introduces a new platform designed for mobile gambling services. The special characteristics of these services lead us to developed a multiservice platform that easily ...
ICSE
2008
IEEE-ACM
14 years 10 months ago
2008
IEEE-ACM
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...