1074 search results - page 108 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
137
click to vote
COLING
1996
15 years 4 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
175
Voted
COLT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
123
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
175
Voted
ICDCS
1996
IEEE
15 years 7 months ago
1996
IEEE
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
125
Voted
SPIN
2004
Springer
15 years 8 months ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...