Sciweavers

314 search results - page 19 / 63
» The Complexity of Coverage
Sort
View
94
Voted
MTDT
2000
IEEE
129views Hardware» more  MTDT 2000»
15 years 4 months ago
Using GLFSRs for Pseudo-Random Memory BIST
In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Rece...
Michael Redeker, Markus Rudack, Thomas Lobbe, Dirk...
ECAI
2010
Springer
15 years 1 months ago
On Testing Answer-Set Programs
Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support...
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
15 years 6 months ago
Radio Resource Allocation Algorithm for Relay-Aided Cellular OFDMA System
— We address the problem of radio resource allocation in the Downlink (DL) of relay–aided cellular system, based on OFDMA transmission technology. There has been little work on...
Megumi Kaneko, Petar Popovski
VTC
2007
IEEE
119views Communications» more  VTC 2007»
15 years 6 months ago
Adaptive Resource Allocation in Cellular OFDMA System with Multiple Relay Stations
— We address the problem of radio resource allocation in the Downlink (DL) of a cellular system with Relay Stations (RS), based on Orthogonal Frequency Division Multiple Access (...
Megumi Kaneko, Petar Popovski
93
Voted
AAAI
2007
15 years 2 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein