Sciweavers

2107 search results - page 290 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ATAL
2011
Springer
12 years 9 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm
FOCS
2002
IEEE
14 years 2 months ago
Load Balancing with Memory
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
Michael Mitzenmacher, Balaji Prabhakar, Devavrat S...
CSR
2006
Springer
14 years 25 days ago
Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
Patrick Cégielski, Irène Guessarian,...
EMSOFT
2004
Springer
14 years 2 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
DATE
2007
IEEE
100views Hardware» more  DATE 2007»
14 years 3 months ago
SoC testing using LFSR reseeding, and scan-slice-based TAM optimization and test scheduling
Abstract— We present an SoC testing approach that integrates test data compression, TAM/test wrapper design, and test scheduling. An improved LFSR reseeding technique is used as ...
Zhanglei Wang, Krishnendu Chakrabarty, Seongmoon W...