126 search results - page 7 / 26 » sara 2007 |
JWSR
2007
13 years 9 months ago
2007
: A major challenge for Service–oriented Computing is how to discover and compose (Web) services to build complex applications. We present a matchmaking system that exploits both...
AML
2006
13 years 10 months ago
2006
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
ICWN
2004
13 years 11 months ago
2004
This paper explores interactions between congestion control mechanisms at the transport layer and scheduling algorithms at the physical layer in the High-Speed Down-link Packet Acc...
SARA
2007
Springer
14 years 4 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
SARA
2007
Springer
14 years 4 months ago
2007
Springer
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...