Sciweavers

2634 search results - page 487 / 527
» Faster Than Uppaal
Sort
View
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 10 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
ICSE
2010
IEEE-ACM
15 years 10 months ago
Test generation through programming in UDITA
We present an approach for describing tests using nondeterministic test generation programs. To write such programs, we introduce UDITA, a Java-based language with non-determinist...
Milos Gligoric, Tihomir Gvero, Vilas Jagannath, Sa...
CIKM
2009
Springer
15 years 10 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
AGENTS
2001
Springer
15 years 10 months ago
Hierarchical multi-agent reinforcement learning
In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multi-agent tasks. We introduce a hierarchical multi-a...
Rajbala Makar, Sridhar Mahadevan, Mohammad Ghavamz...
167
Voted
DCC
2000
IEEE
15 years 10 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...