Sciweavers

2111 search results - page 279 / 423
» How to Program Pervasive Systems
Sort
View
189
Voted
CPAIOR
2010
Springer
15 years 1 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ICFP
2012
ACM
13 years 5 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
EICS
2009
ACM
15 years 10 months ago
Interactive usability instrumentation
Usage data logged from user interactions can be extremely valuable for evaluating software usability. However, instrumenting software to collect usage data is a time-intensive tas...
Scott Bateman, Carl Gutwin, Nathaniel Osgood, Gord...
132
Voted
CSFW
2010
IEEE
15 years 7 months ago
Required Information Release
Abstract—Many computer systems have a functional requirement to release information. Such requirements are an important part of a system’s information security requirements. Cu...
Stephen Chong
155
Voted
EUSAI
2007
Springer
15 years 5 months ago
A Compiler for the Smart Space
Developing applications for smart spaces is a challenging task. Most programming systems narrowly focus on the embedded computer infrastructure and neglect the spatial aspect of th...
Urs Bischoff, Gerd Kortuem