Sciweavers

2268 search results - page 63 / 454
» The Essence of Form Abstraction
Sort
View
HCI
2007
13 years 9 months ago
Coupling Interaction Resources and Technical Support
Coupling is the action of binding two entities so that they can operate together to provide new functions. In this article, we propose a formal definition for coupling and present ...
Nicolas Barralon, Joëlle Coutaz, Christophe L...
JSYML
2006
79views more  JSYML 2006»
13 years 8 months ago
Local-global properties of positive primitive formulas in the theory of spaces of orderings
f spaces of signs (abstract real spectra) developed in [1] [18]. We consider pp (positive primitive) formulas in the language of reduced special groups as in [20]. We denote the pp...
M. Marshall
ICFP
2009
ACM
14 years 8 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 6 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
13 years 8 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene