Sciweavers

15792 search results - page 250 / 3159
» Computational Abstraction Steps
Sort
View
ECOWS
2004
Springer
15 years 11 months ago
Coupled Signature and Specification Matching for Automatic Service Binding
Abstract. Matching of semantic service descriptions is the key to automatic service discovery and binding. Existing approaches split the matchmaking process in two step: signature ...
Michael Klein, Birgitta König-Ries
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
15 years 7 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
LISP
1998
88views more  LISP 1998»
15 years 6 months ago
Visualizing Evaluation in Scheme
Abstract. RainbowScheme is a visual stepping system that presents Scheme program’s runtime state using icons, colored environment trees, and colored Scheme code. A Scheme program...
Sho-Huan Simon Tung
PUC
2002
74views more  PUC 2002»
15 years 6 months ago
Smart Playing Cards: A Ubiquitous Computing Game
Abstract. We present the "Smart Playing Cards" application, a ubiquitous computing game that augments a classical card game with information
Kay Römer, Svetlana Domnitcheva
WIOPT
2011
IEEE
14 years 11 months ago
Distributed function computation in networks: A joint delay-energy perspective
Abstract—This paper considers the following network computation problem:
Nikhil Karamchandani, Massimo Franceschetti