1197 search results - page 223 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
WECWIS
2002
IEEE
14 years 27 days ago
2002
IEEE
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...
FOCS
2000
IEEE
14 years 12 days ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
BMCBI
2007
13 years 8 months ago
2007
Background: As a consequence of the evolutionary process, data collected from related species tend to be similar. This similarity by descent can obscure subtler signals in the dat...
SP
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic...