Sciweavers

3591 search results - page 69 / 719
» Typing linear constraints
Sort
View
ISSTA
2004
ACM
15 years 3 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
15 years 3 months ago
Linear time vehicle relocation in SLAM
Abstract— In this paper we propose an algorithm to determine the location of a vehicle in an environment represented by a stochastic map, given a set of environment measurements ...
José Neira, Juan D. Tardós, Jos&eacu...
JAIR
2008
136views more  JAIR 2008»
14 years 9 months ago
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
James Clarke, Mirella Lapata
ENTCS
2010
133views more  ENTCS 2010»
14 years 4 months ago
Inference of Session Types From Control Flow
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled sess...
Peter Collingbourne, Paul H. J. Kelly
TLDI
2003
ACM
108views Formal Methods» more  TLDI 2003»
15 years 3 months ago
Inferring annotated types for inter-procedural register allocation with constructor flattening
We introduce an annotated type system for a compiler intermediate language. The type system is designed to support inter-procedural register allocation and the representation of t...
Torben Amtoft, Robert Muller