259 search results - page 44 / 52 » Some New Directions and Questions in Parameterized Complexit... |
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
TPLP
2002
13 years 7 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
HOTI
2011
IEEE
12 years 7 months ago
2011
IEEE
—There are many APIs for connecting and exchanging data between network peers. Each interface varies wildly based on metrics including performance, portability, and complexity. S...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
SISW
2003
IEEE
14 years 26 days ago
2003
IEEE
— Smart cards are widely known for their tamper resistance, but only contain a small amount of memory. Though very small, this memory often contains highly valuable information (...