Sciweavers

703 search results - page 39 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
CGO
2010
IEEE
13 years 5 months ago
On improving heap memory layout by dynamic pool allocation
Dynamic memory allocation is widely used in modern programs. General-purpose heap allocators often focus more on reducing their run-time overhead and memory space utilization, but...
Zhenjiang Wang, Chenggang Wu, Pen-Chung Yew
FOCS
2006
IEEE
14 years 1 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
BMCBI
2006
139views more  BMCBI 2006»
13 years 7 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
GIS
2007
ACM
13 years 11 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
ACMSE
2009
ACM
14 years 2 months ago
A case for compiler-driven superpage allocation
Most modern microprocessor-based systems provide support for superpages both at the hardware and software level. Judicious use of superpages can significantly cut down the number...
Joshua Magee, Apan Qasem