Sciweavers

1074 search results - page 108 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
COLING
1996
15 years 7 months ago
Learning Dependencies between Case Frame Slots
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...
Hang Li, Naoki Abe
COLT
2007
Springer
16 years 14 days ago
Regret to the Best vs. Regret to the Average
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...
Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, ...
BIRTHDAY
2009
Springer
16 years 1 months ago
Asynchronous Congestion Games
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...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
ICDCS
1996
IEEE
15 years 10 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
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, ...
Babak Hamidzadeh, David J. Lilja
SPIN
2004
Springer
15 years 11 months ago
Explicit State Model Checking with Hopper
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...
Michael Jones, Eric Mercer