Sciweavers

2976 search results - page 464 / 596
» On the bounded integer programming
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 9 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICFP
2007
ACM
14 years 9 months ago
A type directed translation of MLF to system F
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
Daan Leijen
ESOP
2010
Springer
14 years 6 months ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey
ATAL
2009
Springer
14 years 3 months ago
A distributed constraint optimization approach for coordination under uncertainty
Distributed Constraint Optimization (DCOP) provides a rich framework for modeling multi-agent coordination problems. Existing problem domains for DCOP focus on small (<100 vari...
James Atlas
RTAS
2008
IEEE
14 years 3 months ago
A Modular Worst-case Execution Time Analysis Tool for Java Processors
Recent technologies such as the Real-Time Specification for Java promise to bring Java’s advantages to real-time systems. While these technologies have made Java more predictab...
Trevor Harmon, Martin Schoeberl, Raimund Kirner, R...