1137 search results - page 107 / 228 » Partial Program Admission |
INFORMS
2006
13 years 10 months ago
2006
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
LICS
1991
IEEE
14 years 2 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
EUROSYS
2009
ACM
14 years 7 months ago
2009
ACM
Many of today’s web sites contain substantial amounts of client-side code, and consequently, they act more like programs than simple documents. This creates robustness and perfo...
PLDI
2005
ACM
14 years 4 months ago
2005
ACM
Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architec...