4488 search results - page 298 / 898 » Properties of NP-Complete Sets |
167
click to vote
ECBS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose an equivalent model in a serial queue for representing the serial connection of the load balancer and a Web server of the Web cluster. We have set up an ...
168
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
231
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
The paper presents an approach for performance and complexity analysis of hardware/software implementations for real-time systems on every stage of the partitioning. There are two...
194
click to vote
APWEB
2010
Springer
15 years 10 months ago
2010
Springer
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
170
click to vote
AAAI
2008
15 years 9 months ago
2008
In this paper, we propose a new approach for iterated revision in possibilistic logic by applying a one-step revision operator. We first argue that the set of KM postulates for re...