Sciweavers

3433 search results - page 316 / 687
» Heuristics for a bidding problem
Sort
View
BMCBI
2005
134views more  BMCBI 2005»
15 years 6 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001
COMCOM
1998
102views more  COMCOM 1998»
15 years 6 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
DAC
2009
ACM
16 years 7 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
DAC
2004
ACM
16 years 7 months ago
Data compression for improving SPM behavior
Scratch-pad memories (SPMs) enable fast access to time-critical data. While prior research studied both static and dynamic SPM management strategies, not being able to keep all ho...
Ozcan Ozturk, Mahmut T. Kandemir, I. Demirkiran, G...
SIGMOD
2005
ACM
119views Database» more  SIGMOD 2005»
16 years 7 months ago
DogmatiX Tracks down Duplicates in XML
Duplicate detection is the problem of detecting different entries in a data source representing the same real-world entity. While research abounds in the realm of duplicate detect...
Melanie Weis, Felix Naumann