Sciweavers

3250 search results - page 356 / 650
» An Algorithm to Solve a Linear Program
Sort
View
POPL
1993
ACM
15 years 10 months ago
Type Checking Type Classes
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
Tobias Nipkow, Christian Prehofer
CCE
2004
15 years 6 months ago
Part II. Future perspective on optimization
Following from part I, which presents a retrospective on optimization, we focus here on areas that are recent active research topics and are likely to strongly influence the futur...
Ignacio E. Grossmann, Lorenz T. Biegler
AGI
2008
15 years 8 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
CP
2007
Springer
16 years 25 days ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
CC
2006
Springer
108views System Software» more  CC 2006»
15 years 10 months ago
Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
Teck Bok Tok, Samuel Z. Guyer, Calvin Lin