Sciweavers

203 search results - page 36 / 41
» A New Derandomization of Auctions
Sort
View
SAINT
2006
IEEE
14 years 1 months ago
Fair Overload Handling Using Proof-of-Work Functions
Overload can reduce the overall performance of a computer system up to a point where the whole service might collapse. Thus, for example the load on a server must be controlled to...
Sebastian Golze, Gero Mühl
PDP
2005
IEEE
14 years 1 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
SIGCSE
2004
ACM
132views Education» more  SIGCSE 2004»
14 years 27 days ago
Using game days to teach a multiagent system class
Multiagent systems is an attractive problem solving approach that is becoming ever more feasible and popular in today’s world. It combines artificial intelligence (AI) and distr...
Leen-Kiat Soh
CP
2006
Springer
13 years 11 months ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa
CPAIOR
2006
Springer
13 years 11 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter