Sciweavers

1263 search results - page 199 / 253
» A* with Bounded Costs
Sort
View
CLADE
2004
IEEE
13 years 11 months ago
Engineering a Peer-to-Peer Collaboratory for Tissue Microarray Research
This paper presents the design, development and evaluation of a prototype peer-to-peer collaboratory for imaging, analyzing, and seamlessly sharing tissue microarrays (TMA), corre...
Cristina Schmidt, Manish Parashar, Wenjin Chen, Da...
ECRTS
2004
IEEE
13 years 11 months ago
TLSF: A New Dynamic Memory Allocator for Real-Time Systems
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA inc...
Miguel Masmano, Ismael Ripoll, Alfons Crespo, Jorg...
VLDB
2000
ACM
163views Database» more  VLDB 2000»
13 years 11 months ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
INFOCOM
1995
IEEE
13 years 11 months ago
Analysis of One-Way Reservation Algorithms
Modern high speed networks and ATM networks in particular use resource reservation as a basic means of establishing communications. One-way on-the- y reservation is a method for...
Israel Cidon, Raphael Rom, Yuval Shavitt
IPPS
1995
IEEE
13 years 11 months ago
Data parallel programming in an adaptive environment
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this...
Guy Edjlali, Gagan Agrawal, Alan Sussman, Joel H. ...