Sciweavers

129 search results - page 25 / 26
» Simulation run length planning
Sort
View
CEC
2007
IEEE
14 years 1 months ago
Fingerprint analysis of the noisy prisoner's dilemma
Abstract— Fingerprinting is a technique that permits automatic classification of strategies for playing a game. In this study the evolution of strategies for playing the iterate...
Daniel A. Ashlock, Eun-Youn Kim, Wendy Ashlock
ALT
2003
Springer
14 years 4 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...
INFOCOM
2008
IEEE
14 years 2 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
ISQED
2007
IEEE
141views Hardware» more  ISQED 2007»
14 years 1 months ago
OPC-Friendly Bus Driven Floorplanning
In this paper, we address the interconnect-driven floorplanning problem that integrates OPC-friendly bus assignment with floorplanning. Buses consist of a number of horizontal/v...
Hua Xiang, Liang Deng, Li-Da Huang, Martin D. F. W...
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
14 years 26 days ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas