Sciweavers

2891 search results - page 41 / 579
» More or Less Elaborate
Sort
View
PLDI
2006
ACM
15 years 4 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
87
Voted
ICFP
1999
ACM
15 years 2 months ago
Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
Atsushi Ohori, Nobuaki Yoshida
EWCBR
2006
Springer
15 years 1 months ago
Case-Base Maintenance for CCBR-Based Process Evolution
The success of a company more and more depends on its ability to flexibly and quickly react to changes. Combining process management techniques and conversational case-based reason...
Barbara Weber, Manfred Reichert, Werner Wild
EUROCRYPT
2000
Springer
15 years 1 months ago
Fair Encryption of RSA Keys
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...
Guillaume Poupard, Jacques Stern
IJCAI
2001
14 years 11 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...