Sciweavers

1275 search results - page 98 / 255
» A Simple Focused Crawler
Sort
View
112
Voted
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 3 months ago
Best-Effort Strategies for Losing States
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
Marco Faella
150
Voted
ECCC
2006
71views more  ECCC 2006»
15 years 3 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
136
Voted
IJNM
2008
103views more  IJNM 2008»
15 years 3 months ago
An efficient architecture for Bandwidth Brokers in DiffServ networks
In this article we examine the architecture of an entity used for automatic management and provisioning of resources for DiffServ networks. We examine the existing literature and ...
Christos Bouras, Kostas Stamos
101
Voted
IS
2008
15 years 3 months ago
An analysis of XQuery benchmarks
This paper presents a survey and an analysis of the XQuery benchmark publicly available in 2006 -- XMach-1, XMark, X007, the Michigan benchmark, and XBench -- from different persp...
Loredana Afanasiev, Maarten Marx
131
Voted
IOR
2006
75views more  IOR 2006»
15 years 3 months ago
Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters
This paper studies the M/M/s+M queue, i.e., the M/M/s queue with customer abandonment, also called the Erlang-A model, having independent and identically distributed customer aban...
Ward Whitt