Sciweavers

1679 search results - page 134 / 336
» Scatter Search - Wellsprings and Challenges
Sort
View
ICST
2009
IEEE
16 years 1 months ago
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
Abdul Salam Kalaji, Robert M. Hierons, Stephen Swi...
CIKM
2009
Springer
16 years 29 days ago
Leveraging a scalable row store to build a distributed text index
Many content-oriented applications require a scalable text index. Building such an index is challenging. In addition to the logic of inserting and searching documents, developers ...
Ning Li, Jun Rao, Eugene J. Shekita, Sandeep Tata
IWOMP
2009
Springer
16 years 28 days ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
PCI
2009
Springer
16 years 28 days ago
Investigation of Information Dissemination Design Criteria in Large-Scale Network Environments
—The design of efficient information dissemination mechanism is a challenging problem in large-scale network with respect to the number of messages and termination time. In this...
Konstantinos Oikonomou, Dimitrios Kogias, Leonidas...
FCCM
2008
IEEE
153views VLSI» more  FCCM 2008»
16 years 26 days ago
A SRAM-based Architecture for Trie-based IP Lookup Using FPGA
Internet Protocol (IP) lookup in routers can be implemented by some form of tree traversal. Pipelining can dramatically improve the search throughput. However, it results in unbal...
Hoang Le, Weirong Jiang, Viktor K. Prasanna