Sciweavers

1580 search results - page 80 / 316
» Non-Interference Through Determinism
Sort
View
BMCBI
2010
129views more  BMCBI 2010»
13 years 9 months ago
The LabelHash Algorithm for Substructure Matching
Background: There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseas...
Mark Moll, Drew H. Bryant, Lydia E. Kavraki
ATAL
2007
Springer
14 years 3 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
14 years 2 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
ICC
2009
IEEE
166views Communications» more  ICC 2009»
14 years 4 months ago
A Cross-Layer Perspective on Rateless Coding for Wireless Channels
Abstract—Rateless coding ensures reliability by providing everincreasing redundancy, traditionally at the packet level (i.e. the application layer) through erasure coding. This p...
Thomas A. Courtade, Richard D. Wesel
ICSM
2009
IEEE
14 years 4 months ago
Measuring the progress of projects using the time dependence of code changes
Tracking the progress of a project is often done through imprecise manually gathered information, like progress reports, or through automatic metrics such as Lines Of Code (LOC). ...
Omar Alam, Bram Adams, Ahmed E. Hassan