Sciweavers

2747 search results - page 417 / 550
» Non-oblivious Strategy Improvement
Sort
View
TVLSI
2008
106views more  TVLSI 2008»
14 years 11 months ago
New Non-Volatile Memory Structures for FPGA Architectures
A new set of programmable elements (PEs) using a new non-volatile device for use with routing switches and logical elements within a field-programmable gate array (FPGA) is describ...
David Choi, Kyu Choi, John D. Villasenor
CG
2002
Springer
14 years 11 months ago
A Comparison of Algorithms for Multi-player Games
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
Nathan R. Sturtevant
CG
2002
Springer
14 years 11 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
COMCOM
2000
101views more  COMCOM 2000»
14 years 11 months ago
An intelligent buffer management approach for GFR services in IP/ATM internetworks
In ATM networks, the Guaranteed Frame Rate (GFR) service has been proposed to accommodate non-real-time traffic with packet size not exceeding a maximum length, such as TCP/IP bas...
Pi-Chung Wang, Chia-Tai Chan, Yaw-Chung Chen
CPC
2002
75views more  CPC 2002»
14 years 11 months ago
The Minesweeper Game: Percolation And Complexity
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
Elchanan Mossel