Sciweavers

3229 search results - page 584 / 646
» The Theory of Timed Automata
Sort
View
ICFP
2009
ACM
14 years 10 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
ICFP
2009
ACM
14 years 10 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 10 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
CHI
2009
ACM
14 years 10 months ago
Focus on driving: how cognitive constraints shape the adaptation of strategy when dialing while driving
We investigate how people adapt their strategy for interleaving multiple concurrent tasks to varying objectives. A study was conducted in which participants drove a simulated vehi...
Duncan P. Brumby, Dario D. Salvucci, Andrew Howes
PODC
2009
ACM
14 years 10 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...