973 search results - page 101 / 195 » New Bounds on Crossing Numbers |
303
click to vote
WADS
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
145
click to vote
CIE
2009
Springer
16 years 26 days ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
200
click to vote
VTC
2006
IEEE
16 years 9 days ago
2006
IEEE
Abstract— This paper proposes and evaluates a new aggregation algorithm in wireless sensor networks with time constraint. In the proposed algorithm, each aggregation node control...
173
click to vote
PPAM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
169
click to vote
VTS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents adaptive techniques for improving delay fault diagnosis. These techniques reduce the search space for direct probing which can save a lot of time during failur...