Sciweavers

561 search results - page 38 / 113
» Inferring better contracts
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 11 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
ERLANG
2008
ACM
13 years 9 months ago
Gradual typing of erlang programs: a wrangler experience
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...
Konstantinos F. Sagonas, Daniel Luna
ERCIM
2007
91views more  ERCIM 2007»
13 years 7 months ago
Challenges in a Service-Oriented World
t of view of the service itself. It is an abstracted version of the original service. An operating guideline of a service represents the possible communication behaviours of partne...
Wolfgang Reisig, Karsten Wolf, Jan Bretschneider, ...
CCR
2002
86views more  CCR 2002»
13 years 7 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
ICML
2006
IEEE
14 years 8 months ago
Topic modeling: beyond bag-of-words
Some models of textual corpora employ text generation methods involving n-gram statistics, while others use latent topic variables inferred using the "bag-of-words" assu...
Hanna M. Wallach