Sciweavers

17789 search results - page 3302 / 3558
» Exceptional Use Cases
Sort
View
194
Voted
TASE
2008
IEEE
15 years 6 months ago
Mechanism Design for Single Leader Stackelberg Problems and Application to Procurement Auction Design
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...
Dinesh Garg, Y. Narahari
TC
2008
15 years 6 months ago
Traffic-Balanced Routing Algorithm for Irregular Mesh-Based On-Chip Networks
On-chip networks (OCNs) have been proposed to solve the increasing scale and complexity of the designs in nanoscale multicore VLSI designs. The concept of irregular meshes is an im...
Shu-Yen Lin, Chun-Hsiang Huang, Chih-Hao Chao, Ken...
INFORMATICALT
2007
136views more  INFORMATICALT 2007»
15 years 6 months ago
Generic Multimedia Database Architecture Based upon Semantic Libraries
Semantic-based storage and retrieval of multimedia data requires accurate annotation of the data. Annotation can be done either manually or automatically. The retrieval performance...
Omara Abdul Hamid, Muhammad Abdul Qadir, Nadeem If...
TCBB
2008
95views more  TCBB 2008»
15 years 6 months ago
Solving the Problem of Trans-Genomic Query with Alignment Tables
Abstract-- The trans-genomic query (TGQ) problem -- enabling the free query of biological information, even across genomes -- is a central challenge facing bioinformatics. Solution...
Douglas Stott Parker Jr., Ruey-Lung Hsiao, Yi Xing...
TCS
2008
15 years 6 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
« Prev « First page 3302 / 3558 Last » Next »