Sciweavers

641 search results - page 17 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
ACMMSP
2004
ACM
125views Hardware» more  ACMMSP 2004»
15 years 3 months ago
Improving trace cache hit rates using the sliding window fill mechanism and fill select table
As superscalar processors become increasingly wide, it is inevitable that the large set of instructions to be fetched every cycle will span multiple noncontiguous basic blocks. Th...
Muhammad Shaaban, Edward Mulrane
UAI
2003
14 years 11 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
VR
2010
IEEE
154views Virtual Reality» more  VR 2010»
14 years 8 months ago
On error bound estimation for motion prediction
A collaborative virtual environment (CVE) allows remote users to access and modify shared data through networks, such as the Internet. However, when the users are connected via th...
Rynson W. H. Lau, Kenneth Lee
91
Voted
BMCBI
2005
118views more  BMCBI 2005»
14 years 9 months ago
Feature selection and classification for microarray data analysis: Evolutionary methods for identifying predictive genes
Background: In the clinical context, samples assayed by microarray are often classified by cell line or tumour type and it is of interest to discover a set of genes that can be us...
Thanyaluk Jirapech-Umpai, J. Stuart Aitken
JGAA
2007
135views more  JGAA 2007»
14 years 9 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento