1164 search results - page 201 / 233 » Type based service composition |
157
click to vote
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
139
click to vote
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
140
click to vote
CBSE
2004
Springer
15 years 8 months ago
2004
Springer
According to Szyperski, “a software component is a unit of composition with contractually specified interfaces and explicit context dependencies only”. But it is well known tha...
108
click to vote
IJFCS
2007
15 years 3 months ago
2007
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
104
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we present an application framework that leverages geospatial content on the World Wide Web by enabling innovative modes of interaction and novel types of user inter...